A rounding procedure for semidefinite optimization

DOI10.1016/J.ORL.2018.12.003MaRDI QIDQ2294267zbMATH OpenOpenAlexWikidataFDO

Authors Ali Mohammad Nezhad, Tamás Terlaky

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

interior point methodssemidefinite optimizationoptimal partitionmaximally complementary solution

Mathematics Subject Classification ID

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

Recommendations

• On the identification of the optimal partition for semidefinite optimization
• scientific article; zbMATH DE number 1754595
• Complex semidefinite programming and Max-\(k\)-Cut
• The RPR2 rounding technique for semidefinite programs
• Semidefinite programming and combinatorial optimization

Cites work

• scientific article; zbMATH DE number 3121284 (Why is no real title available?)
• scientific article; zbMATH DE number 47363 (Why is no real title available?)
• scientific article; zbMATH DE number 1502618 (Why is no real title available?)
• A complementarity partition theorem for multifold conic systems
• A strongly polynomial rounding procedure yielding a maximally complementary solution for \(P_*(\kappa)\) linear complementarity problems
• Error Bounds for Linear Matrix Inequalities
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding
• Interior Point Trajectories in Semidefinite Programming
• On the Convergence of the Central Path in Semidefinite Optimization
• On the finite convergence of interior-point algorithms for linear programming
• On the identification of the optimal partition of second order cone optimization problems
• Perturbation analysis of second-order cone programming problems
• Unifying optimal partition approach to sensitivity analysis in conic optimization

Cited in

(7)

• Parametric analysis of semidefinite optimization
• A feasible rounding approach for mixed-integer optimization problems
• Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming
• Penalized semidefinite programming for quadratically-constrained quadratic optimization
• Optimal bounds for round-off errors in the cyclic peaceman-rachford iteration
• On the identification of the optimal partition for semidefinite optimization
• The RPR2 rounding technique for semidefinite programs

This page was built for publication: A rounding procedure for semidefinite optimization

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