A rounding procedure for semidefinite optimization

DOI10.1016/j.orl.2018.12.003zbMath1476.90234OpenAlexW2904904726WikidataQ128777452 ScholiaQ128777452MaRDI QIDQ2294267

Tamás Terlaky, Ali Mohammad Nezhad

Publication date: 10 February 2020

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

Full work available at URL: https://doi.org/10.1016/j.orl.2018.12.003

zbMATH Keywords

optimal partitionsemidefinite optimizationinterior point methodsmaximally complementary solution

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51)

Related Items

Penalized semidefinite programming for quadratically-constrained quadratic optimization, Parametric analysis of semidefinite optimization

Cites Work

• On the finite convergence of interior-point algorithms for linear programming
• Unifying optimal partition approach to sensitivity analysis in conic optimization
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding
• A complementarity partition theorem for multifold conic systems
• Perturbation analysis of second-order cone programming problems
• A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems
• Interior Point Trajectories in Semidefinite Programming
• Error Bounds for Linear Matrix Inequalities
• On the Convergence of the Central Path in Semidefinite Optimization
• On the Identification of the Optimal Partition of Second Order Cone Optimization Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item