Solving the discrete \(l_p\)-approximation problem by a method of centers
From MaRDI portal
Publication:5936070
DOI10.1016/S0377-0427(00)00542-2zbMath0983.65072MaRDI QIDQ5936070
Publication date: 2 July 2001
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
complexityinterior point methodscomputational resultsconstrained convex programming problemdiscrete \(l_p\)-approximation problemlogarithmic barriermethod of analytic centersNewton-type methods
Numerical mathematical programming methods (65K05) Convex programming (90C25) Interior-point methods (90C51) Algorithms for approximation of functions (65D15)
Cites Work
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities
- A cutting plane algorithm for convex programming that uses analytic centers
- A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
- Complexity estimates of some cutting plane methods based on the analytic barrier
- A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
- An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems
- On Vaidya's Volumetric Cutting Plane Method for Convex Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
