Fast First-Order Algorithms for Packing–Covering Semidefinite Programs

DOI10.1007/978-1-4614-3924-0_3zbMath1327.90177OpenAlexW2218929171MaRDI QIDQ3454972

Garud 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)

Cites Work

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

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