Properties of equation reformulation of the Karush-Kuhn-Tucker condition for nonlinear second order cone optimization problems

DOI10.1007/s00186-008-0241-xzbMath1190.49031OpenAlexW2036177754MaRDI QIDQ1040684

Yun Wang, Li-wei Zhang

Publication date: 25 November 2009

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-008-0241-x

zbMATH Keywords

second order coneSQP-type methodconstraint nondegeneracy conditionequation reformulationstrong second order sufficient condition

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Optimality conditions for problems in abstract spaces (49K27)

Related Items

Properties associated with the epigraph of the \(l_1\) norm function of projection onto the nonnegative orthant, Nonsingularity conditions for FB system of reformulating nonlinear second-order cone programming, On the upper Lipschitz property of the KKT mapping for nonlinear semidefinite optimization, Statistical Inference of Second-Order Cone Programming, Superlinear convergence of the sequential quadratic method in constrained optimization, Jacobian nonsingularity in nonlinear symmetric conic programming problems and its application, S<i>l</i>₁QP Based Algorithm with Trust Region Technique for Solving Nonlinear Second-Order Cone Programming Problems, On the characterizations of solutions to perturbed l₁ conic optimization problem, Variational geometry of the complementarity set for second order cone, On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem, A sensitivity result for quadratic second-order cone programming and its application., Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints

Uses Software

• PLCP

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence analysis of the augmented Lagrangian method for nonlinear second-order cone optimization problems
• On the inverse function theorem
• Lipschitzian inverse functions, directional derivatives, and applications in \(C^{1,1}\) optimization
• Second-order cone programming
• Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
• A nonsmooth version of Newton's method
• An SQP-type algorithm for nonlinear second-order cone programs
• Perturbation analysis of second-order cone programming problems
• Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
• Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
• Optimization and nonsmooth analysis
• First Order Conditions for General Nonlinear Optimization
• Semismooth and Semiconvex Functions in Constrained Optimization
• The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
• Convex Analysis
• Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
• A further result on an implicit function theorem for locally Lipschitz functions