New constraint qualifications and optimality conditions for second order cone programs
From MaRDI portal
Publication:2328203
DOI10.1007/s11228-018-0487-2zbMath1423.90249OpenAlexW2810610491MaRDI QIDQ2328203
Publication date: 9 October 2019
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11228-018-0487-2
second order necessary conditionsfirst order necessary conditionsconstant rank of the subspace component conditionnonlinear second order cone programmingrelaxed constant rank constraint qualification
Related Items
The rate of convergence of proximal method of multipliers for second-order cone optimization problems ⋮ First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition ⋮ New constraint qualifications for mathematical programs with second-order cone complementarity constraints ⋮ Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications ⋮ 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 ⋮ Erratum to: ``New constraint qualifications and optimality conditions for second order cone programs
Cites Work
- Unnamed Item
- Constant-rank condition and second-order constraint qualification
- On second-order optimality conditions for vector optimization
- A relaxed constant positive linear dependence constraint qualification and applications
- Alternative second-order cone programming formulations for support vector classification
- On relaxing the Mangasarian-Fromovitz constraint qualification
- Applications of second-order cone programming
- Second-order cone programming
- Second order cone programming approach to two-stage network data envelopment analysis
- Directional derivatives of the solution of a parametric nonlinear program
- Perturbation analysis of second-order cone programming problems
- An efficient support vector machine learning method with second-order cone programming for large-scale problems
- Parametric Nonlinear Programming Problems under the Relaxed Constant Rank Condition
- On relaxed constant rank regularity condition in mathematical programming
- Directional derivative of the marginal function in nonlinear programming
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps
- Two New Weak Constraint Qualifications and Applications
- Nonlinear Programming
- Convex Analysis
