Feasible and accurate algorithms for covering semidefinite programs

DOI10.1007/978-3-642-13731-0_15MaRDI QIDQ3569887zbMATHOpenAlexFDO

Authors G. Iyengar, David J. Phillips, Clifford Stein

Publication date 22 June 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13731-0_15

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Semidefinite programming (90C22)

Recommendations

• Approximating semidefinite packing programs
• Fast First-Order Algorithms for Packing–Covering Semidefinite Programs
• Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
• Approximation algorithms and semidefinite programming.
• Semidefinite programming and combinatorial optimization

Cited in

(4)

• Approximating semidefinite packing programs
• Finding Sparse Solutions for Packing and Covering Semidefinite Programs
• A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs
• A primal barrier function phase I algorithm for nonsymmetric conic optimization problems

Describes a project that uses

Uses Software

• DSPCA

This page was built for publication: Feasible and accurate algorithms for covering semidefinite programs

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