A simple method for convex optimization in the oracle model
From MaRDI portal
Publication:2164690
DOI10.1007/978-3-031-06901-7_12zbMath1497.90147arXiv2011.08557OpenAlexW3211344788MaRDI QIDQ2164690
Stefan Weltge, Daniel Dadush, Sophie Huiberts, Christopher Hojny
Publication date: 16 August 2022
Full work available at URL: https://arxiv.org/abs/2011.08557
Cites Work
- Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem
- A strongly polynomial algorithm for linear systems having a binary solution
- Newton's method for convex programming and Tschebyscheff approximation
- Geometric algorithms and combinatorial optimization
- Augmented self-concordant barriers and nonlinear optimization problems with finite complexity
- A new algorithm for minimizing convex functions over convex sets
- A cutting plane algorithm for convex programming that uses analytic centers
- Lectures on Modern Convex Optimization
- An Efficient Rescaled Perceptron Algorithm for Conic Systems
- Outline of an algorithm for integer solutions to linear programs
- The Cutting-Plane Method for Solving Convex Programs
- The maximum concurrent flow problem
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems
- First-Order Methods in Optimization
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- Rescaling Algorithms for Linear Conic Feasibility
- An improved cutting plane method for convex optimization, convex-concave games, and its applications
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- Maximum matching and a polyhedron with 0,1-vertices
- A simple polynomial-time rescaling algorithm for solving linear programs
- Linear programming boosting via column generation
- Unnamed Item
- Unnamed Item
This page was built for publication: A simple method for convex optimization in the oracle model
