Iterated linear optimization
From MaRDI portal
Publication:5157412
DOI10.1090/qam/1594zbMath1478.90085arXiv2012.02213OpenAlexW3157522700MaRDI QIDQ5157412
Pedro Felzenszwalb, Alice Paul, Caroline J. Klivans
Publication date: 18 October 2021
Published in: Quarterly of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.02213
Convex programming (90C25) Combinatorial optimization (90C27) Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48)
Cites Work
- Fixed-point algorithms for inverse problems in science and engineering. Based on the presentations at the interdisciplinary workshop, BIRS, Banff, Canada, November 1--6, 2009.
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Iterative approximation of fixed points
- A first course in discrete dynamical systems
- Cuts, matrix completions and graph rigidity
- On a positive semidefinite relaxation of the cut polytope
- The geometry of SDP-exactness in quadratic optimization
- WHAT IS...a Spectrahedron?
- Discrete Dynamical Systems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- How to Round Any CSP
- Rounding sum-of-squares relaxations
- Limit Points of Sequences in Metric Spaces
This page was built for publication: Iterated linear optimization
