A second-order sequential optimality condition associated to the convergence of optimization algorithms
From MaRDI portal
Publication:4683812
DOI10.1093/imanum/drw064zbMath1433.90156OpenAlexW2575646877MaRDI QIDQ4683812
Paulo J. S. Silva, Alberto Ramos, Gabriel Haeser, Roberto Andreani
Publication date: 26 September 2018
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/67f95be35a1d7125544856894525420fceca0d5c
Related Items
Some theoretical limitations of second-order algorithms for smooth constrained optimization ⋮ Second-order enhanced optimality conditions and constraint qualifications ⋮ A Note on the McCormick Second-Order Constraint Qualification ⋮ 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 ⋮ On the approximate solutions of augmented subproblems within sequential methods for nonlinear programming ⋮ Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points ⋮ Simple algorithms for optimization on Riemannian manifolds with constraints ⋮ Convergence Properties of a Second Order Augmented Lagrangian Method for Mathematical Programs with Complementarity Constraints ⋮ New Sequential Optimality Conditions for Mathematical Programs with Complementarity Constraints and Algorithmic Consequences ⋮ Optimality conditions and global convergence for nonlinear semidefinite programming ⋮ An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem ⋮ 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