Initialization in semidefinite programming via a self-dual skew-symmetric embedding

DOI10.1016/S0167-6377(97)00011-4zbMath0881.90096WikidataQ126643518 ScholiaQ126643518MaRDI QIDQ1362529

Etienne de Klerk, Tamás Terlaky, Cornelis Roos

Publication date: 2 March 1998

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

semidefinite programmingdualityinterior point algorithmscentral pathinitializationself-dual skew-symmetric problem

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

On the identification of the optimal partition for semidefinite optimization, Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier, Embedding methods for semidefinite programming, Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms, Conic convex programming and self-dual embedding, An algorithm for nonsymmetric conic optimization inspired by MOSEK, Limiting behavior of the central path in semidefinite optimization, A tighter relaxation for the relative pose problem between cameras, Facial Reduction and Partial Polyhedrality, Constructing uniquely realizable graphs, Fast certifiable relative pose estimation with gravity prior, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022, Semidefinite programming and matrix scaling over the semidefinite cone., Generating and measuring instances of hard semidefinite programs, Interior Point Methods for Nonlinear Optimization, An easy way to teach interior-point methods., Asymptotic behavior of the central path for a special class of degenerate SDP problems, On the behavior of the homogeneous self-dual model for conic convex optimization, Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming, Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone, A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization, Solving semidefinite programs using preconditioned conjugate gradients, A rounding procedure for semidefinite optimization, Characterizing the universal rigidity of generic frameworks, A new barrier for a class of semidefinite problems, Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions, Analyticity of the central path at the boundary point in semidefinite programming, Error Bounds and Singularity Degree in Semidefinite Programming, Semidefinite programming, On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization, Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach

Uses Software

• SDPHA

Cites Work

• Unnamed Item
• Convergence behavior of interior-point algorithms
• Superlinear convergence of interior-point algorithms for semidefinite programming
• Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
• Symmetric primal-dual path-following algorithms for semidefinite programming
• On homogeneous and self-dual algorithms for LCP
• Complementarity and nondegeneracy in semidefinite programming
• An exact duality theory for semidefinite programming and its complexity implications
• On a homogeneous algorithm for the monotone complementarity problem
• On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
• Interior Point Trajectories in Semidefinite Programming
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• The theory of linear programming:skew symmetric self-dual problems and the central path^*
• Semidefinite Programming