Nonsingularity in second-order cone programming via the smoothing metric projector

DOI10.1007/s11425-009-0207-3zbMath1220.90100OpenAlexW1979340429MaRDI QIDQ977261

Yun Wang, Li-wei Zhang

Publication date: 21 June 2010

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-009-0207-3

zbMATH Keywords

smoothing Newton methodsecond-order cone programming problemB-subdifferentialClarke's generalized Jacobiansmoothing metric projector

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Sensitivity, stability, parametric optimization (90C31)

Related Items

Nonsingularity in matrix conic optimization induced by spectral norm via a smoothing metric projector ⋮ On some aspects of perturbation analysis for matrix cone optimization induced by spectral norm ⋮ Variational analysis of norm cones in finite dimensional Euclidean spaces ⋮ Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications ⋮ Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search

Cites Work

• Unnamed Item
• Unnamed Item
• Analysis of nonsmooth vector-valued functions associated with second-order cones.
• 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 new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• An SQP-type algorithm for nonlinear second-order cone programs
• Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
• Perturbation analysis of second-order cone programming problems
• Smoothing Functions for Second-Order-Cone Complementarity Problems
• Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
• A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
• The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
• Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems