Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
From MaRDI portal
Publication:683332
DOI10.1007/s10589-017-9937-2zbMath1411.90316OpenAlexW2748610528WikidataQ111288194 ScholiaQ111288194MaRDI QIDQ683332
Gabriel Haeser, Ernesto G. Birgin, Alberto Ramos
Publication date: 6 February 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-017-9937-2
Related Items
Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization, A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms, Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints, Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems, Some theoretical limitations of second-order algorithms for smooth constrained optimization, Towards an efficient augmented Lagrangian method for convex quadratic programming, On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming, A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees, A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees, Optimality conditions for nonlinear second-order cone programming and symmetric cone programming, On the approximate solutions of augmented subproblems within sequential methods for nonlinear programming, A brief introduction to manifold optimization, Optimality Conditions and Constraint Qualifications for Generalized Nash Equilibrium Problems and Their Practical Implications, Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints, Simple algorithms for optimization on Riemannian manifolds with constraints, On the Burer-Monteiro method for general semidefinite programs, Optimality conditions and global convergence for nonlinear semidefinite programming, An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem, Towards tractable constraint qualifications for parametric optimisation problems and applications to generalised Nash games, Augmented Lagrangian method for second-order cone programs under second-order sufficiency, Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary, Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences, On Optimality Conditions for Nonlinear Conic Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A practical relative error criterion for augmented Lagrangians
- A stabilized SQP method: superlinear convergence
- Combining and scaling descent and negative curvature directions
- Outer trust-region method for constrained optimization
- A relaxed constant positive linear dependence constraint qualification and applications
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
- Addressing the greediness phenomenon in nonlinear programming by means of proximal augmented Lagrangians
- A note on the convergence of barrier algorithms to second-order necessary points
- Packing up to 50 equal circles in a square
- An augmented Lagrangian interior-point method using directions of negative curvature
- Foundations of bilevel programming
- A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
- Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions
- An example comparing the standard and safeguarded augmented Lagrangian methods
- On a conjecture in second-order optimality conditions
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- A trust-region strategy for minimization on arbitrary domains
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Algebraic rules for quadratic regularization of Newton's method
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Optimality properties of an augmented Lagrangian method on infeasible problems
- Sequential equality-constrained optimization for nonlinear programming
- Second-order negative-curvature methods for box-constrained and general constrained optimization
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Multiplier and gradient methods
- Convergence to Second Order Stationary Points in Inequality Constrained Optimization
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
- On relaxed constant rank regularity condition in mathematical programming
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Directional derivative of the marginal function in nonlinear programming
- A Cone-Continuity Constraint Qualification and Algorithmic Consequences
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Some NP-complete problems in quadratic and nonlinear programming
- The Geometry of Algorithms with Orthogonality Constraints
- New convergence results on an algorithm for norm constrained regularization and related problems
- ARPACK Users' Guide
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- Accelerated Methods for NonConvex Optimization
- A second-order sequential optimality condition associated to the convergence of optimization algorithms
- Two New Weak Constraint Qualifications and Applications
- Finding approximate local minima faster than gradient descent
- The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization
- On second-order optimality conditions in nonlinear optimization
- On the Classical Necessary Second-Order Optimality Conditions in the Presence of Equality and Inequality Constraints
- On second-order optimality conditions for nonlinear programming
- Algorithm 813
- Practical Augmented Lagrangian Methods for Constrained Optimization
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- Definite and Semidefinite Quadratic Forms
- On sequential optimality conditions for smooth constrained optimization
