Fast First-Order Algorithms for Packing–Covering Semidefinite Programs

DOI10.1007/978-1-4614-3924-0_3MaRDI QIDQ3454972zbMATH OpenOpenAlexFDO

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

Publication date 3 December 2015

Published in Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4614-3924-0_3

Mathematics Subject Classification ID

Semidefinite programming (90C22) Combinatorial optimization (90C27)

Recommendations

• Approximating semidefinite packing programs
• Exact Semidefinite Programming Bounds for Packing Problems
• Faster and simpler approximation algorithms for mixed packing and covering problems
• Fast approximation of matroid packing and covering
• Finding Sparse Solutions for Packing and Covering Semidefinite Programs
• Fast Approximation Algorithms for Fractional Packing and Covering Problems
• Approximation algorithms for covering/packing integer programs
• A fast approximation algorithm for solving the complete set packing problem
• Fast LP-based Approximations for Geometric Packing and Covering Problems
• A semidefinite programming hierarchy for packing problems in discrete geometry

Cites work

• Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
• Approximating semidefinite packing programs
• Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression
• Convex quadratic and semidefinite programming relaxations in scheduling
• Fast Approximation Algorithms for Fractional Packing and Covering Problems
• Smooth minimization of non-smooth functions
• Smoothing technique and its applications in semidefinite optimization
• The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover

Cited in

(4)

• Approximating semidefinite packing programs
• Feasible and accurate algorithms for covering semidefinite programs
• Finding Sparse Solutions for Packing and Covering Semidefinite Programs
• Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs

This page was built for publication: Fast First-Order Algorithms for Packing–Covering Semidefinite Programs

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