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

DOI10.1016/S0167-6377(97)00011-4zbMATH Open0881.90096WikidataQ126643518 ScholiaQ126643518MaRDI QIDQ1362529FDOQ1362529

Authors: E. de Klerk, C. Roos, Tamás Terlaky 

Publication date: 2 March 1998

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

Recommendations

• Conic convex programming and self-dual embedding
• scientific article; zbMATH DE number 1182578
• Embedding methods for semidefinite programming
• scientific article; zbMATH DE number 1489798

zbMATH Keywords

semidefinite programmingdualityinterior point algorithmscentral pathinitializationself-dual skew-symmetric problem

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• Semidefinite Programming
• Title not available (Why is that?)
• An exact duality theory for semidefinite programming and its complexity implications
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• On homogeneous and self-dual algorithms for LCP
• On a homogeneous algorithm for the monotone complementarity problem
• Complementarity and nondegeneracy in semidefinite programming
• On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
• Superlinear convergence of interior-point algorithms for semidefinite programming
• The theory of linear programming:skew symmetric self-dual problems and the central path^*
• Convergence behavior of interior-point algorithms
• Symmetric primal-dual path-following algorithms for semidefinite programming
• Interior Point Trajectories in Semidefinite Programming
• Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming

Cited In (34)

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

Uses Software

• SDPHA

This page was built for publication: Initialization in semidefinite programming via a self-dual skew-symmetric embedding

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