Block coordinate descent for smooth nonconvex constrained minimization

DOI10.1007/s10589-022-00389-5zbMath1496.90092arXiv2111.13103OpenAlexW3217235274MaRDI QIDQ2162523

Ernesto G. Birgin, José Mario Martínez

Publication date: 8 August 2022

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.13103

zbMATH Keywords

complexityconvergencecoordinate descent methods

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
• A cyclic block coordinate descent method with generalized gradient projections
• Coordinate descent algorithms
• A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• On Regularization and Active-set Methods with Complexity for Constrained Optimization
• On search directions for minimization algorithms