Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
From MaRDI portal
Publication:535069
DOI10.1007/S10957-010-9758-2zbMATH Open1229.90080OpenAlexW2072337808MaRDI QIDQ535069FDOQ535069
Authors: Lingchen Kong, Levent Tunçel, Naihua Xiu 
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
Recommendations
- Jacobian nonsingularity in nonlinear symmetric conic programming problems and its application
- An equivalency condition of nonsingularity in nonlinear semidefinite programming
- Jacobian uniqueness theorem for nonlinear semidefinite programming
- Jordan-algebraic aspects of nonconvex optimization over symmetric cones
- An equivalent problem in nonconvex semidefinite programming
- On constraint qualifications in terms of approximate Jacobians for nonsmooth continuous optimization problems
- On optimality conditions for nonlinear conic programming
- Equivalence of two nondegeneracy conditions for semidefinite programs
- Perturbation analysis of a class of conic programming problems under Jacobian uniqueness conditions
- The conjugate duality of nonlinear semidefinite programming
variational analysisnonsingularityB-subdifferentialconstraint nondegeneracystrong regularityClarke's generalized Jacobianlinear symmetric cone programming
Cites Work
- Title not available (Why is that?)
- Convex Analysis
- A nonsmooth version of Newton's method
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- On the inverse function theorem
- Some P-properties for linear transformations on Euclidean Jordan algebras
- On the basic theorem of complementarity
- Complementarity and nondegeneracy in semidefinite programming
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- First and second order analysis of nonlinear semidefinite programs
- Sensitivity analysis of generalized equations
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
- Nondegeneracy and Quantitative Stability of Parameterized Optimization Problems with Multiple Solutions
- On the local convergence of semismooth Newton methods for linear and nonlinear second-order cone programs without strict complementarity
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- Title not available (Why is that?)
- Semismooth Matrix-Valued Functions
- Clarke generalized Jacobian of the projection onto symmetric cones
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- The Minnesota notes on Jordan algebras and their applications. Edited and annotated by Aloys Krieg and Sebastian Walcher
- Nonsmooth Equations: Motivation and Algorithms
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Lipschitzian inverse functions, directional derivatives, and applications in \(C^{1,1}\) optimization
- Constraint Nondegeneracy in Variational Analysis
- On Eigenvalue Optimization
- Inverse and implicit function theorems forH-differentiable and semismooth functions
- On the generic properties of convex optimization problems in conic form
- Equivalence of two nondegeneracy conditions for semidefinite programs
- An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming
- Unifying optimal partition approach to sensitivity analysis in conic optimization
Cited In (17)
- An equivalency condition of nonsingularity in nonlinear semidefinite programming
- Lowest-rank solutions of continuous and discrete Lyapunov equations over symmetric cone
- Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method
- Jacobian uniqueness theorem for nonlinear semidefinite programming
- Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search
- On minimal rank solutions to symmetric Lyapunov equations in Euclidean Jordan algebra
- Transversality condition and optimization of higher order ordinary differential inclusions
- Jacobian nonsingularity in nonlinear symmetric conic programming problems and its application
- Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software
- Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
- Lyapunov-type least-squares problems over symmetric cones
- Jordan-algebraic aspects of nonconvex optimization over symmetric cones
- Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity
- Clarke generalized Jacobian of the projection onto symmetric cones
- The triviality condition for kernels of quadratic mappings and its application in optimization methods
- A Lipschitzian error bound for monotone symmetric cone linear complementarity problem
- Nonsingularity conditions for FB system of reformulating nonlinear second-order cone programming
Uses Software
This page was built for publication: Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535069)
