Optimality conditions for nonlinear second-order cone programming and symmetric cone programming
From MaRDI portal
Publication:6182322
DOI10.1007/s10957-023-02338-6OpenAlexW4389455337MaRDI QIDQ6182322
No author found.
Publication date: 25 January 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-023-02338-6
optimality conditionssymmetric conesaugmented Lagrangian methodconstraint qualificationssecond-order cones
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Newton's method may fail to recognize proximity to optimal points in constrained optimization
- On approximate KKT condition and its extension to continuous variational inequalities
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
- Approximate Karush-Kuhn-Tucker condition in multiobjective optimization
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- Convergence of the augmented Lagrangian method for nonlinear optimization problems over second-order cones
- Applications of second-order cone programming
- Second-order cone programming
- On implementing a primal-dual interior-point method for conic quadratic optimization
- An approximate strong KKT condition for multiobjective optimization
- A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
- On the minimization of possibly discontinuous functions by means of pointwise approximations
- A note on approximate Karush-Kuhn-Tucker conditions in locally Lipschitz multiobjective optimization
- Augmented Lagrangian and exact penalty methods for quasi-variational inequalities
- Convergence detection for optimization algorithms: approximate-KKT stopping criterion when Lagrange multipliers are not available
- On the use of Jordan algebras for improving global convergence of an augmented Lagrangian method in nonlinear semidefinite programming
- Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming
- Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
- An augmented Lagrangian method for quasi-equilibrium problems
- Optimality conditions and global convergence for nonlinear semidefinite programming
- Approximate KKT points and a proximity measure for termination
- An SQP-type algorithm for nonlinear second-order cone programs
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
- On relaxed constant rank regularity condition in mathematical programming
- A Cone-Continuity Constraint Qualification and Algorithmic Consequences
- A primal–dual interior point method for nonlinear optimization over second-order cones
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- An Augmented Lagrangian Method for Optimization Problems in Banach Spaces
- Optimality Conditions and Constraint Qualifications for Generalized Nash Equilibrium Problems and Their Practical Implications
- Erratum “A second-order sequential optimality condition associated to the convergence of optimization algorithms”
- Notes on Duality in Second Order and p -Order Cone Optimization
- Differentiable Exact Penalty Functions for Nonlinear Second-Order Cone Programs
- On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
- New Sequential Optimality Conditions for Mathematical Programs with Complementarity Constraints and Algorithmic Consequences
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
- Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method
- Practical Augmented Lagrangian Methods for Constrained Optimization
- Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences
- On sequential optimality conditions for smooth constrained optimization
This page was built for publication: Optimality conditions for nonlinear second-order cone programming and symmetric cone programming