Rounding of convex sets and efficient gradient methods for linear programming problems
From MaRDI portal
Publication:5459820
Recommendations
- Linear Programming in O([n3/ln n]L) Operations
- A new polynomial-time algorithm for linear programming
- New algorithms for linear programming
- Rounding of Polytopes in the Real Number Model of Computation
- A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
Cites work
- Ellipsoidal approximations of convex sets based on the volumetric barrier
- Excessive Gap Technique in Nonsmooth Convex Minimization
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
- Introductory lectures on convex optimization. A basic course.
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Minimum-volume enclosing ellipsoids and core sets
- Potential function methods for approximately solving linear programming problems: theory and practice.
- Rounding of Polytopes in the Real Number Model of Computation
- Smooth minimization of non-smooth functions
Cited in
(6)- Self-concordant barriers for convex approximations of structured convex sets
- OSGA: a fast subgradient algorithm with optimal complexity
- Barrier subgradient method
- Gradient methods for minimizing composite functions
- The RPR2 rounding technique for semidefinite programs
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and =(1/)-convergence
This page was built for publication: Rounding of convex sets and efficient gradient methods for linear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459820)
