First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
From MaRDI portal
Publication:463746
DOI10.1007/S10107-013-0735-ZzbMATH Open1301.49036OpenAlexW2159874655MaRDI QIDQ463746FDOQ463746
Authors: 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
Recommendations
- First-Order Optimality Conditions for Mathematical Programs with Second-Order Cone Complementarity Constraints
- First order necessary optimality conditions for mathematical programs with second-order cone complementarity constraints
- Mathematical programs with semidefinite cone complementarity constraints: constraint qualifications and optimality conditions
- Second-order optimality conditions for mathematical program with semidefinite cone complementarity constraints and applications
- First-order optimality conditions in generalized semi-infinite programming
- First order optimality conditions for generalized semi-infinite programming problems
- scientific article; zbMATH DE number 5056696
- scientific article; zbMATH DE number 592635
- First-order optimality conditions for convex semi-infinite min-max programming with noncompact sets
- Necessary optimality conditions for mathematical programs with second-order cone complementarity constraints
mathematical programmingnonsmooth analysisnecessary optimality conditionssemidefinite cone complementarity constraints
Nonlinear programming (90C30) Semidefinite programming (90C22) Nonsmooth analysis (49J52) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Optimality conditions (49K99)
Cites Work
- Variational Analysis
- Title not available (Why is that?)
- Convex Analysis
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Foundations of bilevel programming
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Optimization and nonsmooth analysis
- Some continuity properties of polyhedral multifunctions
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Calmness of a Class of Multifunctions
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Nonsmooth sequential analysis in Asplund spaces
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Generalized differential calculus for nonsmooth and set-valued mappings
- Über monotone Matrixfunktionen
- Nonsmooth analysis of eigenvalues
- Robust optimization-methodology and applications
- Robust convex optimization
- Lipschitz Behavior of Solutions to Convex Minimization Problems
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Mathematical Programs with Equilibrium Constraints
- On analyticity of functions involving eigenvalues
- Sensitivity analysis of all eigenvalues of a symmetric matrix
- On the basic theorem of complementarity
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Optimal low-rank approximation to a correlation matrix
- A sequential semismooth Newton method for the nearest low-rank correlation matrix problem
- On the Sum of the Largest Eigenvalues of a Symmetric Matrix
- Calmness of constraint systems with applications
- On the Guignard constraint qualification for mathematical programs with equilibrium constraints
- First Order Conditions for General Nonlinear Optimization
- Strong Semismoothness of Eigenvalues of Symmetric Matrices and Its Application to Inverse Eigenvalue Problems
- First-Order and Second-Order Conditions for Error Bounds
- Semismooth Matrix-Valued Functions
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- An approximation theory of matrix rank minimization and its application to quadratic equations
- Optimality Conditions for Optimization Problems with Complementarity Constraints
- Exact calculation of the multiloop stability margin
- Approximation of rank function and its application to the nearest low-rank correlation matrix
- Semi-Definite Matrix Constraints in Optimization
- Smoothing method for mathematical programs with symmetric cone complementarity constraints
- Reduced order Kalman filtering without model reduction
- Robust stability analysis of systems with real parametric uncertainty: A global optimization approach
Cited In (43)
- Optimality conditions for the simple convex bilevel programming problem in Banach spaces
- Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications
- Optimal control problems with terminal complementarity constraints
- On the Aubin property of a class of parameterized variational systems
- First-Order Optimality Conditions for Mathematical Programs with Second-Order Cone Complementarity Constraints
- A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery
- Characterizations of tilt-stable minimizers in second-order cone programming
- Variational analysis and full stability of optimal solutions to constrained and minimax problems
- B-subdifferential of the projection onto the generalized spectraplex
- Strong stationarity for optimization problems with complementarity constraints in absence of polyhedricity. With applications to optimization with semidefinite and second-order-cone complementarity constraints
- Variational Convexity of Functions and Variational Sufficiency in Optimization
- A penalty method for rank minimization problems in symmetric matrices
- On conic QPCCs, conic QCQPs and completely positive programs
- Title not available (Why is that?)
- Spectral operators of matrices
- The limiting normal cone to pointwise defined sets in Lebesgue spaces
- Variational analysis of spectral functions simplified
- Mathematical programs with second-order cone complementarity constraints: strong stationarity and approximation method
- Multistage convex relaxation approach to rank regularized minimization problems based on equivalent mathematical program with a generalized complementarity constraint
- Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials
- Second-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive Systems
- The models of bilevel programming with lower level second-order cone programs
- On properties of the bilinear penalty function method for mathematical programs with semidefinite cone complementarity constraints
- Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming
- On the convergence properties of a smoothing approach for mathematical programs with symmetric cone complementarity constraints
- Mathematical programs with semidefinite cone complementarity constraints: constraint qualifications and optimality conditions
- First order solutions in conic programming
- 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
- Two relaxation methods for rank minimization problems
- Optimality conditions for special semidefinite bilevel optimization problems
- Second-order optimality conditions for nonconvex set-constrained optimization problems
- Several classes of stationary points for rank regularized minimization problems
- Mathematical programs with complementarity constraints in Banach spaces
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
- Generalized differentiation of piecewise linear functions in second-order variational analysis
- Facial approach for constructing stationary points for mathematical programs with cone complementarity constraints
- Regular and limiting normal cones to the graph of the subdifferential mapping of the nuclear norm
- Exact formulas for the proximal/regular/limiting normal cone of the second-order cone complementarity set
- Second order sufficient conditions for a class of bilevel programs with lower level second-order cone programming problem
- Second-order optimality conditions for mathematical program with semidefinite cone complementarity constraints and applications
- Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization
- Title not available (Why is that?)
This page was built for publication: First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463746)
