Mathematical programs with semidefinite cone complementarity constraints: constraint qualifications and optimality conditions
From MaRDI portal
Recommendations
- Second-order optimality conditions for mathematical program with semidefinite cone complementarity constraints and applications
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
- First order necessary optimality conditions for mathematical programs with second-order cone complementarity constraints
- First-Order Optimality Conditions for Mathematical Programs with Second-Order Cone Complementarity Constraints
- Scaled constraint qualifications and necessary optimality conditions for nonsmooth mathematical programs with second-order cone complementarity constraints
Cites work
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints
- First Order Conditions for General Nonlinear Optimization
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
- Foundations of bilevel programming
- scientific article; zbMATH DE number 3772411 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Mathematical Programs with Equilibrium Constraints
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Robust convex optimization
- Second Order Optimality Conditions Based on Parabolic Second Order Tangent Sets
- Semismooth Matrix-Valued Functions
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Variational Analysis
Cited in
(19)- Scaled constraint qualifications and necessary optimality conditions for nonsmooth mathematical programs with second-order cone complementarity constraints
- A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery
- Computation of graphical derivatives of normal cone maps to a class of conic constraint sets
- On properties of the bilinear penalty function method for mathematical programs with semidefinite cone complementarity constraints
- Regular and limiting normal cones to the graph of the subdifferential mapping of the nuclear norm
- Mathematical programs with second-order cone complementarity constraints: strong stationarity and approximation method
- Asymptotic analysis for a stochastic semidefinite programming
- Second-order optimality conditions for mathematical program with semidefinite cone complementarity constraints and applications
- A note on strict complementarity for the doubly non-negative cone
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
- Optimality conditions for special semidefinite bilevel optimization problems
- Mathematical programs with complementarity constraints in Banach spaces
- Critical Multipliers in Semidefinite Programming
- Strong stationarity for optimization problems with complementarity constraints in absence of polyhedricity. With applications to optimization with semidefinite and second-order-cone complementarity constraints
- Multistage convex relaxation approach to rank regularized minimization problems based on equivalent mathematical program with a generalized complementarity constraint
- Strong calmness of perturbed KKT system for a class of conic programming with degenerate solutions
- On the directional asymptotic approach in optimization theory
- Facial approach for constructing stationary points for mathematical programs with cone complementarity constraints
- Projected gradient descent accumulates at Bouligand stationary points
This page was built for publication: Mathematical programs with semidefinite cone complementarity constraints: constraint qualifications and optimality conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456990)
