First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints

DOI10.1007/s10107-013-0735-zzbMath1301.49036OpenAlexW2159874655MaRDI QIDQ463746

Chao Ding, Jane J. Ye, Defeng Sun

Publication date: 17 October 2014

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-013-0735-z

zbMATH Keywords

necessary optimality conditionsnonsmooth analysismathematical programmingsemidefinite cone complementarity constraints

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Optimality conditions (49K99)

Related Items

A penalty method for rank minimization problems in symmetric matrices, On conic QPCCs, conic QCQPs and completely positive programs, First-Order Optimality Conditions for Mathematical Programs with Second-Order Cone Complementarity Constraints, Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints, Optimal Control Problems with Terminal Complementarity Constraints, The models of bilevel programming with lower level second-order cone programs, Spectral operators of matrices, Second-order optimality conditions for mathematical program with semidefinite cone complementarity constraints and applications, The limiting normal cone to pointwise defined sets in Lebesgue spaces, Regular and limiting normal cones to the graph of the subdifferential mapping of the nuclear norm, Multistage Convex Relaxation Approach to Rank Regularized Minimization Problems Based on Equivalent Mathematical Program with a Generalized Complementarity Constraint, Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications, Mathematical programs with second-order cone complementarity constraints: strong stationarity and approximation method, Second-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive Systems, Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials, Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization, Generalized differentiation of piecewise linear functions in second-order variational analysis, Variational Convexity of Functions and Variational Sufficiency in Optimization, Two relaxation methods for rank minimization problems, Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming, Mathematical programs with semidefinite cone complementarity constraints: constraint qualifications and optimality conditions, On the convergence properties of a smoothing approach for mathematical programs with symmetric cone complementarity constraints, Unnamed Item, A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery, Several Classes of Stationary Points for Rank Regularized Minimization Problems, Mathematical programs with complementarity constraints in Banach spaces, Optimality conditions for the simple convex bilevel programming problem in Banach spaces, Optimality Conditions for Special Semidefinite Bilevel Optimization Problems, Exact formulas for the proximal/regular/limiting normal cone of the second-order cone complementarity set, On the Aubin property of a class of parameterized variational systems, Strong stationarity for optimization problems with complementarity constraints in absence of polyhedricity. With applications to optimization with semidefinite and second-order-cone complementarity constraints, Characterizations of Tilt-Stable Minimizers in Second-Order Cone Programming, Variational analysis of spectral functions simplified, Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian, First order necessary optimality conditions for mathematical programs with second-order cone complementarity constraints, On properties of the bilinear penalty function method for mathematical programs with semidefinite cone complementarity constraints, Variational analysis and full stability of optimal solutions to constrained and minimax problems, Second-Order Optimality Conditions for Nonconvex Set-Constrained Optimization Problems, Second order sufficient conditions for a class of bilevel programs with lower level second-order cone programming problem, B-subdifferential of the projection onto the generalized spectraplex

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation of rank function and its application to the nearest low-rank correlation matrix
• An approximation theory of matrix rank minimization and its application to quadratic equations
• Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
• Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
• Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
• Generalized differential calculus for nonsmooth and set-valued mappings
• On analyticity of functions involving eigenvalues
• Sensitivity analysis of all eigenvalues of a symmetric matrix
• Nonsmooth analysis of eigenvalues
• Foundations of bilevel programming
• Über monotone Matrixfunktionen
• Robust optimization-methodology and applications
• Optimal low-rank approximation to a correlation matrix
• Calmness of constraint systems with applications
• Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
• Robust Convex Optimization
• Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
• REDUCED ORDER KALMAN FILTERING WITHOUT MODEL REDUCTION
• Smoothing method for mathematical programs with symmetric cone complementarity constraints
• A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem
• Lipschitz Behavior of Solutions to Convex Minimization Problems
• On the Guignard constraint qualification for mathematical programs with equilibrium constraints
• Semi-Definite Matrix Constraints in Optimization
• Optimization and nonsmooth analysis
• Exact calculation of the multiloop stability margin
• Some continuity properties of polyhedral multifunctions
• On the Sum of the Largest Eigenvalues of a Symmetric Matrix
• Stability Theory for Systems of Inequalities. Part I: Linear Systems
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• First Order Conditions for General Nonlinear Optimization
• Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
• Variational Analysis
• Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
• Strong Semismoothness of Eigenvalues of Symmetric Matrices and Its Application to Inverse Eigenvalue Problems
• Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
• First-Order and Second-Order Conditions for Error Bounds
• Optimality Conditions for Optimization Problems with Complementarity Constraints
• On the Calmness of a Class of Multifunctions
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Robust stability analysis of systems with real parametric uncertainty: A global optimization approach
• Nonsmooth sequential analysis in Asplund spaces
• 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
• Mathematical Programs with Equilibrium Constraints