Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization
- 3 March 2022
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 82 (1) , 175-224
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (DMS-2053493)
This publication has 43 references indexed in Scilit:
- On the complexity of finding first-order critical points in constrained nonlinear optimizationMathematical Programming, 2012
- Iteration-complexity of first-order penalty methods for convex programmingMathematical Programming, 2012
- Local Convergence of Exact and Inexact Augmented Lagrangian Methods under the Second-Order Sufficient Optimality ConditionSIAM Journal on Optimization, 2012
- On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear ProgrammingSIAM Journal on Optimization, 2011
- Barrier subgradient methodMathematical Programming, 2010
- A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear OptimizationSIAM Journal on Optimization, 2005
- An Exact Penalization Viewpoint of Constrained OptimizationSIAM Journal on Control and Optimization, 1991
- On the Convergence of a Sequential Penalty Function Method for Constrained MinimizationSIAM Journal on Numerical Analysis, 1989
- A Continuously Differentiable Exact Penalty Function for Nonlinear Programming Problems with Inequality ConstraintsSIAM Journal on Control and Optimization, 1985
- Penalty Functions1983