Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming
From MaRDI portal
Publication:2082228
Abstract: In [R. Andreani, G. Haeser, L. M. Mito, H. Ram'irez C., Weak notions of nondegeneracy in nonlinear semidefinite programming, arXiv:2012.14810, 2020] the classical notion of nondegeneracy (or transversality) and Robinson's constraint qualification have been revisited in the context of nonlinear semidefinite programming exploiting the structure of the problem, namely, its eigendecomposition. This allows formulating the conditions equivalently in terms of (positive) linear independence of significantly smaller sets of vectors. In this paper we extend these ideas to the context of nonlinear second-order cone programming. For instance, for an -dimensional second-order cone, instead of stating nondegeneracy at the vertex as the linear independence of derivative vectors, we do it in terms of several statements of linear independence of derivative vectors. This allows embedding the structure of the second-order cone into the formulation of nondegeneracy and, by extension, Robinson's constraint qualification as well. This point of view is shown to be crucial in defining significantly weaker constraint qualifications such as the constant rank constraint qualification and the constant positive linear dependence condition. Also, these conditions are shown to be sufficient for guaranteeing global convergence of several algorithms, while still implying metric subregularity and without requiring boundedness of the set of Lagrange multipliers.
Recommendations
- Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
- First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition
- An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming
- New constraint qualifications and optimality conditions for second order cone programs
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
Cites work
- A relaxed constant positive linear dependence constraint qualification and applications
- An SQP-type algorithm for nonlinear second-order cone programs
- Applications of second-order cone programming
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- Augmented Lagrangian method for second-order cone programs under second-order sufficiency
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Complete characterizations of tilt stability in nonlinear programming under weakest qualification conditions
- Constant-rank condition and second-order constraint qualification
- Differential properties of the marginal function in mathematical programming
- Directional derivative of the marginal function in nonlinear programming
- Directional differentiability of the optimal value function in a nonlinear programming problem
- Erratum to: ``New constraint qualifications and optimality conditions for second order cone programs
- Exact formula for the second-order tangent set of the second-order cone complementarity set
- Full Stability of Locally Optimal Solutions in Second-Order Cone Programs
- Graphical derivatives and stability analysis for parameterized equilibria with conic constraints
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines
- Multiplier and gradient methods
- Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
- New constraint qualifications and optimality conditions for second order cone programs
- New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches
- On computation of generalized derivatives of the normal-cone mapping and their applications
- On Eigenvalue Optimization
- On M-stationarity conditions in MPECs and the associated qualification conditions
- On relaxed constant rank regularity condition in mathematical programming
- On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees
- On the Aubin property of critical points to perturbed second-order cone programs
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Parametric Nonlinear Programming Problems under the Relaxed Constant Rank Condition
- PENNON: A code for convex nonlinear and semidefinite programming
- Perturbation analysis of second-order cone programming problems
- Second order sufficient conditions for a class of bilevel programs with lower level second-order cone programming problem
- Second-order cone programming
- Second-order variational analysis in conic programming with applications to optimality and stability
- Some remarks on stability of generalized equations
- Two new weak constraint qualifications and applications
Cited in
(11)- An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming
- Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
- Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications
- First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition
- On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming
- New constraint qualifications for mathematical programs with second-order cone complementarity constraints
- Optimality conditions for nonlinear second-order cone programming and symmetric cone programming
- A minimal face constant rank constraint qualification for reducible conic programming
- New constraint qualifications based on the decomposition of the cone defined by the Karush-Kuhn-Tucker conditions
- A second-order sequential optimality condition for nonlinear second-order cone programming problems
- On semidefinite representations of second-order conic optimization problems
This page was built for publication: Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2082228)
