Complementarity and nondegeneracy in semidefinite programming
From MaRDI portal
Publication:1373731
zbMath0890.90141MaRDI QIDQ1373731
Jean-Pierre A. Haeberly, Farid Alizadeh, Michael L. Overton
Publication date: 25 November 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items (86)
On how to solve large-scale log-determinant optimization problems ⋮ Sufficient optimality conditions hold for almost all nonlinear semidefinite programs ⋮ A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence ⋮ Correlation stress testing for value-at-risk: an unconstrained convex optimization approach ⋮ The algebraic degree of semidefinite programming ⋮ GMRES-Accelerated ADMM for Quadratic Objectives ⋮ Optimal estimation of sensor biases for asynchronous multi-sensor data fusion ⋮ Initialization in semidefinite programming via a self-dual skew-symmetric embedding ⋮ Variational principles and the related bounding theorems for bi-modulus materials ⋮ Convex sets with semidefinite representation ⋮ Certifying the global optimality of quartic minimization over the sphere ⋮ Semidefinite programming in combinatorial optimization ⋮ Universal duality in conic convex optimization ⋮ Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems ⋮ Eigenvalue-constrained faces ⋮ Linear systems in Jordan algebras and primal-dual interior-point algorithms ⋮ On an SDP relaxation for kissing number ⋮ A Newton-like method for solving rank constrained linear matrix inequalities ⋮ Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process ⋮ SDP-based branch-and-bound for non-convex quadratic integer optimization ⋮ First order solutions in conic programming ⋮ On the stable solution of large scale problems over the doubly nonnegative cone ⋮ Newton's method for computing the nearest correlation matrix with a simple upper bound ⋮ Statistical inference of semidefinite programming with multiple parameters ⋮ Fast certifiable relative pose estimation with gravity prior ⋮ Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates ⋮ Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds ⋮ A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming ⋮ Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization ⋮ A note on probably certifiably correct algorithms ⋮ A strict complementarity approach to error bound and sensitivity of solution of conic programs ⋮ An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization ⋮ On continuous selections of polynomial functions ⋮ Generic Properties for Semialgebraic Programs ⋮ Approximating data in \({\mathbb R}^{n}\) by a quadratic underestimator with specified Hessian minimum and maximum eigenvalues ⋮ A complementarity partition theorem for multifold conic systems ⋮ $LDL^T$ Direction Interior Point Method for Semidefinite Programming ⋮ Genericity Results in Linear Conic Programming—A Tour d’Horizon ⋮ Positive semidefinite matrix completion, universal rigidity and the strong Arnold property ⋮ Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection ⋮ A refined theorem concerning the conditioning of semidefinite programs ⋮ A note on strict complementarity for the doubly non-negative cone ⋮ A guide to conic optimisation and its applications ⋮ Statistical inference of semidefinite programming ⋮ Analyticity of weighted central paths and error bounds for semidefinite programming ⋮ Cone-LP's and semidefinite programs: Geometry and a simplex-type method ⋮ On the Simplicity and Conditioning of Low Rank Semidefinite Programs ⋮ An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity ⋮ Universal rigidity of bar frameworks via the geometry of spectrahedra ⋮ Tightness of the maximum likelihood semidefinite relaxation for angular synchronization ⋮ Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems ⋮ Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming ⋮ Equivalence of two nondegeneracy conditions for semidefinite programs ⋮ Singularity Degree of the Positive Semidefinite Matrix Completion Problem ⋮ A semidefinite programming study of the Elfving theorem ⋮ An admissible dual internal point method for a linear semidefinite programming problem ⋮ Two-phase simplex method for linear semidefinite optimization ⋮ On self-regular IPMs (with comments and rejoinder) ⋮ Preprocessing and Regularization for Degenerate Semidefinite Programs ⋮ On bar frameworks, stress matrices and semidefinite programming ⋮ A projected semismooth Newton method for problems of calibrating least squares covariance matrix ⋮ A survey on conic relaxations of optimal power flow problem ⋮ Generic Minimizing Behavior in Semialgebraic Optimization ⋮ Inverse optimal control for discrete-time finite-horizon linear quadratic regulators ⋮ Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity ⋮ An inexact primal-dual path following algorithm for convex quadratic SDP ⋮ Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming ⋮ An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization ⋮ Projection Methods in Conic Optimization ⋮ Intrinsic volumes of symmetric cones and applications in convex programming ⋮ Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion ⋮ A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization ⋮ Parametric analysis of semidefinite optimization ⋮ Characterizing the universal rigidity of generic frameworks ⋮ Similarity and other spectral relations for symmetric cones ⋮ Affine scaling algorithm fails for semidefinite programming ⋮ Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP ⋮ Scalable Semidefinite Programming ⋮ On parametric semidefinite programming ⋮ On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming ⋮ Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs ⋮ Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach ⋮ Error Bounds and Singularity Degree in Semidefinite Programming ⋮ A long-step primal-dual path-following method for semidefinite programming ⋮ On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate ⋮ On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization
This page was built for publication: Complementarity and nondegeneracy in semidefinite programming
