A simple method for convex optimization in the oracle model
From MaRDI portal
Recommendations
- A simple method for convex optimization in the oracle model
- Efficient convex optimization with oracles
- A cutting plane algorithm for convex programming that uses analytic centers
- A new algorithm for minimizing convex functions over convex sets
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems
Cites work
- A cutting plane algorithm for convex programming that uses analytic centers
- A new algorithm for minimizing convex functions over convex sets
- A simple method for convex optimization in the oracle model
- A simple polynomial-time rescaling algorithm for solving linear programs
- A strongly polynomial algorithm for linear systems having a binary solution
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- An efficient rescaled perceptron algorithm for conic systems
- An improved cutting plane method for convex optimization, convex-concave games, and its applications
- Complexity estimates of some cutting plane methods based on the analytic barrier
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- First-order methods in optimization
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 4041641 (Why is no real title available?)
- scientific article; zbMATH DE number 3516928 (Why is no real title available?)
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Linear programming boosting via column generation
- Maximum matching and a polyhedron with 0,1-vertices
- Near-linear time approximation schemes for some implicit fractional packing problems
- Newton's method for convex programming and Tschebyscheff approximation
- Outline of an algorithm for integer solutions to linear programs
- Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem
- Rescaling algorithms for linear conic feasibility
- The Cutting-Plane Method for Solving Convex Programs
- The maximum concurrent flow problem
This page was built for publication: A simple method for convex optimization in the oracle model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589751)
