On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization - researchr publication

researchr

You are not signed in
Sign in
Sign up

V. S. Amaral, Roberto Andreani, Ernesto G. Birgin, Diaulas S. Marcondes, José Mario Martínez. On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization. J. Global Optimization, 84(3):527-561, 2022. [doi]

Abstract is missing.

runs on WebDSL