Feasible and Accurate Algorithms for Covering Semidefinite Programs
From MaRDI portal
Publication:3569887
DOI10.1007/978-3-642-13731-0_15zbMath1285.90029OpenAlexW1584295491MaRDI QIDQ3569887
Garud 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
Semidefinite programming (90C22) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Finding Sparse Solutions for Packing and Covering Semidefinite Programs, A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
Uses Software