Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
From MaRDI portal
Publication:535069
DOI10.1007/s10957-010-9758-2zbMath1229.90080OpenAlexW2072337808MaRDI QIDQ535069
Lingchen Kong, Nai-Hua Xiu, Tunçel, Levent
Publication date: 11 May 2011
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.173.4711
strong regularityvariational analysisnonsingularityconstraint nondegeneracyB-subdifferentialClarke's generalized Jacobianlinear symmetric cone programming
Related Items (10)
A Lipschitzian error bound for monotone symmetric cone linear complementarity problem ⋮ Transversality condition and optimization of higher order ordinary differential inclusions ⋮ Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity ⋮ Jacobian nonsingularity in nonlinear symmetric conic programming problems and its application ⋮ Lowest-rank solutions of continuous and discrete Lyapunov equations over symmetric cone ⋮ Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search ⋮ Lyapunov-type least-squares problems over symmetric cones ⋮ On minimal rank solutions to symmetric Lyapunov equations in Euclidean Jordan algebra ⋮ Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity ⋮ Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unifying optimal partition approach to sensitivity analysis in conic optimization
- Some P-properties for linear transformations on Euclidean Jordan algebras
- Clarke generalized Jacobian of the projection onto symmetric cones
- On the inverse function theorem
- The Minnesota notes on Jordan algebras and their applications. Edited and annotated by Aloys Krieg and Sebastian Walcher
- Lipschitzian inverse functions, directional derivatives, and applications in \(C^{1,1}\) optimization
- Complementarity and nondegeneracy in semidefinite programming
- First and second order analysis of nonlinear semidefinite programs
- Sensitivity analysis of generalized equations
- A nonsmooth version of Newton's method
- Equivalence of two nondegeneracy conditions for semidefinite programs
- Nonsmooth Equations: Motivation and Algorithms
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
- Optimization and nonsmooth analysis
- Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
- Strongly Regular Generalized Equations
- Semismooth and Semiconvex Functions in Constrained Optimization
- Nondegeneracy and Quantitative Stability of Parameterized Optimization Problems with Multiple Solutions
- Inverse and implicit function theorems forH-differentiable and semismooth functions
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- On Eigenvalue Optimization
- On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Convex Analysis
- On the basic theorem of complementarity
- Semismooth Matrix-Valued Functions
- Constraint Nondegeneracy in Variational Analysis
- An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming
- On the generic properties of convex optimization problems in conic form
This page was built for publication: Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
