A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
From MaRDI portal
Publication:1639726
DOI10.1007/S10589-018-0005-3zbMath1391.90636OpenAlexW2796766994WikidataQ111288278 ScholiaQ111288278MaRDI QIDQ1639726
Publication date: 13 June 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-018-0005-3
Related Items (12)
On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming ⋮ On the fulfillment of the complementary approximate Karush-Kuhn-Tucker conditions and algorithmic applications ⋮ 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 ⋮ On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods ⋮ Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points ⋮ New Sequential Optimality Conditions for Mathematical Programs with Complementarity Constraints and Algorithmic Consequences ⋮ On the use of Jordan algebras for improving global convergence of an augmented Lagrangian method in nonlinear semidefinite programming ⋮ Optimality conditions and global convergence for nonlinear semidefinite programming ⋮ An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem ⋮ Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary ⋮ On Optimality Conditions for Nonlinear Conic Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A primal-dual algorithm for nonlinear programming exploiting negative curvature directions
- Corrigendum to: ``On the complexity of finding first-order critical points in constrained nonlinear optimization
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
- On affine scaling algorithms for nonconvex quadratic programming
- On the complexity of approximating a KKT point of quadratic programming
- An augmented Lagrangian interior-point method using directions of negative curvature
- Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions
- Second-order negative-curvature methods for box-constrained and general constrained optimization
- Some theoretical limitations of second-order algorithms for smooth constrained optimization
- A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Convergence to Second Order Stationary Points in Inequality Constrained Optimization
- Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models
- A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
- A Cone-Continuity Constraint Qualification and Algorithmic Consequences
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- On the Convergence Theory of Trust-Region-Based Algorithms for Equality-Constrained Optimization
- Trust Region Methods
- A stabilized SQP method: global convergence
- Erratum “A second-order sequential optimality condition associated to the convergence of optimization algorithms”
- Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization
- Two New Weak Constraint Qualifications and Applications
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
- Convergence to Second-Order Stationary Points of a Primal-Dual Algorithm Model for Nonlinear Programming
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- On second-order optimality conditions for nonlinear programming
- Practical Augmented Lagrangian Methods for Constrained Optimization
- On sequential optimality conditions for smooth constrained optimization
- A new trust-region algorithm for equality constrained optimization
- On the global convergence of interior-pointnonlinear programming algorithms
This page was built for publication: A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
