Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization

DOI10.1080/10556788.2023.2189711zbMath1522.90126OpenAlexW4361221605MaRDI QIDQ6113530

Geovani Nunes Grapiglia

Publication date: 9 August 2023

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2023.2189711

zbMATH Keywords

nonlinear programminghigh-order methodsworst-case complexityquadratic penalty method

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Unnamed Item
• Unnamed Item
• Corrigendum to: ``On the complexity of finding first-order critical points in constrained nonlinear optimization
• On the worst-case evaluation complexity of non-monotone line search algorithms
• Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
• Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
• Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models
• On the complexity of finding first-order critical points in constrained nonlinear optimization
• Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models
• On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization
• On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
• Numerical Optimization
• On High-order Model Regularization for Constrained Optimization
• On Regularization and Active-set Methods with Complexity for Constrained Optimization
• Complexity Analysis of a Trust Funnel Algorithm for Equality Constrained Optimization
• An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
• Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity
• Tensor methods for finding approximate stationary points of convex functions
• On the complexity of an augmented Lagrangian method for nonconvex optimization
• Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs
• Non-Linear Programming Via Penalty Functions
• On a Method of Courant for Minimizing Functionals