A new algorithm for minimizing convex functions over convex sets
From MaRDI portal
Publication:1918926
DOI10.1007/BF02592216zbMath0852.90112MaRDI QIDQ1918926
Publication date: 9 December 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
convex optimizationoracleglobal convergence rateellipsoid of maximum volumevolumetric center of a polytope
Related Items
A note on approximation of a ball by polytopes, Volumetric path following algorithms for linear programming, Approximation algorithms for inventory problems with submodular or routing costs, A simple method for convex optimization in the oracle model, Large step volumetric potential reduction algorithms for linear programming, Complexity estimates of some cutting plane methods based on the analytic barrier, A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere, A class of volumetric barrier decomposition algorithms for stochastic quadratic programming, First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems, Models and algorithms for distributionally robust least squares problems, Complexity of optimizing over the integers, Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting), A cutting plane method for solving KYP-SDPs, A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem, A class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming, A simple polynomial-time rescaling algorithm for solving linear programs, Interior Point Methods for Nonlinear Optimization, An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming, On complexity of the translational-cut algorithm for convex minimax problems, The mixing time of the Dikin walk in a polytope -- a simple proof, Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices, Testing the manifold hypothesis, A constraint generation algorithm for large scale linear programs using multiple-points separation, Unnamed Item, A survey on models and algorithms for discrete evacuation planning network problems, Logarithmic regret algorithms for online convex optimization, On risk-averse stochastic semidefinite programs with continuous recourse, A geometric characterization of ``optimality-equivalent relaxations, Computing sharp bounds for hard clustering problems on trees, Solving convex min-min problems with smoothness and strong convexity in one group of variables and low dimension in the other, Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method, Heat flow and a faster algorithm to compute the surface area of a convex body, A technique for speeding up the solution of the Lagrangean dual, Randomized interior point methods for sampling and optimization, Fast Core Pricing for Rich Advertising Auctions
Uses Software
Cites Work
- Matrix multiplication via arithmetic progressions
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Cutting planes and column generation techniques with the projective algorithm
- A Potential Reduction Algorithm Allowing Column Generation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
