Complementarity and nondegeneracy in semidefinite programming

zbMATH Open0890.90141MaRDI QIDQ1373731FDOQ1373731

Authors: Farid Alizadeh, Jean-Pierre A. Haeberly, Michael L. Overton 

Publication date: 25 November 1997

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

Recommendations

• Solvability of semidefinite complementarity problems
• On semidefinite linear complementarity problems
• Semidefinite programming in combinatorial optimization
• The semidefinite linear complementarity problem
• scientific article; zbMATH DE number 1944141
• Semidefinite programming and combinatorial optimization
• Semidefinite programming and combinatorial optimization
• Semidefinite programming in combinatorial and polynomial optimization
• scientific article; zbMATH DE number 2102033
• Semidefinite programming

zbMATH Keywords

semidefinite programmingnondegeneracy conditions

Mathematics Subject Classification ID

Linear programming (90C05)

Cited In (95)

• Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
• Parametric analysis of semidefinite optimization
• Characterizing the universal rigidity of generic frameworks
• Affine scaling algorithm fails for semidefinite programming
• Universal duality in conic convex optimization
• A semidefinite programming study of the Elfving theorem
• Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
• Preprocessing and regularization for degenerate semidefinite programs
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding
• On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
• On how to solve large-scale log-determinant optimization problems
• Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming
• An admissible dual internal point method for a linear semidefinite programming problem
• A survey on conic relaxations of optimal power flow problem
• A Newton-like method for solving rank constrained linear matrix inequalities
• Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
• A strict complementarity approach to error bound and sensitivity of solution of conic programs
• Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
• A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence
• Semidefinite programming in combinatorial optimization
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
• On self-regular IPMs (with comments and rejoinder)
• A long-step primal-dual path-following method for semidefinite programming
• The algebraic degree of semidefinite programming
• On the central path of semidefinite optimization: degree and worst-case convergence rate
• An inexact primal-dual path following algorithm for convex quadratic SDP
• Generic minimizing behavior in semialgebraic optimization
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
• On the stable solution of large scale problems over the doubly nonnegative cone
• Optimal estimation of sensor biases for asynchronous multi-sensor data fusion
• Some New Results for the Semidefinite Linear Complementarity Problem
• First order solutions in conic programming
• Equivalence of two nondegeneracy conditions for semidefinite programs
• A projected semismooth Newton method for problems of calibrating least squares covariance matrix
• An introduction to formally real Jordan algebras and their applications in optimization
• Variational principles and the related bounding theorems for bi-modulus materials
• On parametric semidefinite programming
• Generic properties for semialgebraic programs
• Cone-LP's and semidefinite programs: geometry and a simplex-type method
• Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
• Similarity and other spectral relations for symmetric cones
• A note on probably certifiably correct algorithms
• Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity
• Strict complementarity in semidefinite optimization with elliptopes including the maxcut SDP
• Analyticity of weighted central paths and error bounds for semidefinite programming
• Genericity results in linear conic programming -- a tour d'horizon
• Statistical inference of semidefinite programming
• Inverse optimal control for discrete-time finite-horizon linear quadratic regulators
• Two-phase simplex method for linear semidefinite optimization
• Approximating data in \({\mathbb R}^{n}\) by a quadratic underestimator with specified Hessian minimum and maximum eigenvalues
• Correlation stress testing for value-at-risk: an unconstrained convex optimization approach
• Projection Methods in Conic Optimization
• Newton's method for computing the nearest correlation matrix with a simple upper bound
• Eigenvalue-constrained faces
• Intrinsic volumes of symmetric cones and applications in convex programming
• On bar frameworks, stress matrices and semidefinite programming
• A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming
• Convex sets with semidefinite representation
• Universal rigidity of bar frameworks via the geometry of spectrahedra
• Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
• Positive semidefinite matrix completion, universal rigidity and the strong Arnold property
• Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization
• A feasible method for general convex low-rank SDP problems
• A refined theorem concerning the conditioning of semidefinite programs
• A guide to conic optimisation and its applications
• An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
• On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization
• Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process
• A note on strict complementarity for the doubly non-negative cone
• On the simplicity and conditioning of low rank semidefinite programs
• Fast certifiable relative pose estimation with gravity prior
• GMRES-accelerated ADMM for quadratic objectives
• Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
• Synchronous values of games
• \(LDL^T\) direction interior point method for semidefinite programming
• Certifying the global optimality of quartic minimization over the sphere
• On an SDP relaxation for kissing number
• On continuous selections of polynomial functions
• Riemannian Langevin algorithm for solving semidefinite programs
• Error bounds and singularity degree in semidefinite programming
• Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments
• Towards optimal spatio-temporal decomposition of control-related sum-of-squares programs
• Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds
• Parametric conic optimization problems over semidefinite plus nonnegative cone
• A complementarity partition theorem for multifold conic systems
• Scalable semidefinite programming
• Statistical inference of semidefinite programming with multiple parameters
• Accelerated first-order methods for a class of semidefinite programs
• Facial approach for constructing stationary points for mathematical programs with cone complementarity constraints
• SDP-based branch-and-bound for non-convex quadratic integer optimization
• Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates
• Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs
• Singularity degree of the positive semidefinite matrix completion problem
• An optimal-storage approach to semidefinite programming using approximate complementarity

This page was built for publication: Complementarity and nondegeneracy in semidefinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373731)