Feasible and accurate algorithms for covering semidefinite programs

DOI10.1007/978-3-642-13731-0_15zbMATH Open1285.90029OpenAlexW1584295491MaRDI QIDQ3569887FDOQ3569887

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

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

Mathematics Subject Classification ID

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

Cited In (3)

• A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
• Finding Sparse Solutions for Packing and Covering Semidefinite Programs
• Approximating semidefinite packing programs

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)