Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
From MaRDI portal
Publication:535069
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
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 1534289 (Why is no real title available?)
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- A nonsmooth version of Newton's method
- An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming
- Clarke generalized Jacobian of the projection onto symmetric cones
- Complementarity and nondegeneracy in semidefinite programming
- Constraint Nondegeneracy in Variational Analysis
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Convex Analysis
- Equivalence of two nondegeneracy conditions for semidefinite programs
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First and second order analysis of nonlinear semidefinite programs
- Inverse and implicit function theorems forH-differentiable and semismooth functions
- Lipschitzian inverse functions, directional derivatives, and applications in \(C^{1,1}\) optimization
- Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- Nondegeneracy and Quantitative Stability of Parameterized Optimization Problems with Multiple Solutions
- Nonsmooth Equations: Motivation and Algorithms
- On Eigenvalue Optimization
- On the basic theorem of complementarity
- On the generic properties of convex optimization problems in conic form
- On the inverse function theorem
- On the local convergence of semismooth Newton methods for linear and nonlinear second-order cone programs without strict complementarity
- Optimization and nonsmooth analysis
- Semismooth Matrix-Valued Functions
- Semismooth and Semiconvex Functions in Constrained Optimization
- Sensitivity analysis of generalized equations
- Some P-properties for linear transformations on Euclidean Jordan algebras
- Strongly Regular Generalized Equations
- The Minnesota notes on Jordan algebras and their applications. Edited and annotated by Aloys Krieg and Sebastian Walcher
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Unifying optimal partition approach to sensitivity analysis in conic optimization
Cited in
(17)- Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
- Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software
- On minimal rank solutions to symmetric Lyapunov equations in Euclidean Jordan algebra
- The triviality condition for kernels of quadratic mappings and its application in optimization methods
- Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search
- Clarke generalized Jacobian of the projection onto symmetric cones
- Transversality condition and optimization of higher order ordinary differential inclusions
- Jacobian nonsingularity in nonlinear symmetric conic programming problems and its application
- Jacobian uniqueness theorem for nonlinear semidefinite programming
- An equivalency condition of nonsingularity in nonlinear semidefinite programming
- Nonsingularity conditions for FB system of reformulating nonlinear second-order cone programming
- Lyapunov-type least-squares problems over symmetric cones
- A Lipschitzian error bound for monotone symmetric cone linear complementarity problem
- Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity
- 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
- Jordan-algebraic aspects of nonconvex optimization over symmetric cones
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)
