Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
Lectures on modern convex optimization: analysis, algorithms, and engineering applications
Lectures on modern convex optimization: analysis, algorithms, and engineering applications
Smooth minimization of non-smooth functions
Mathematical Programming: Series A and B
Excessive Gap Technique in Nonsmooth Convex Minimization
SIAM Journal on Optimization
Rounding of convex sets and efficient gradient methods for linear programming problems
Optimization Methods & Software
| Hi-index | 0.00 |
In this paper, we present a new approach to constructing schemes for unconstrained convex minimization, which computes approximate solutions with a certain relative accuracy. This approach is based on a special conic model of the unconstrained minimization problem. Using a structural model of the objective function, we can employ the efficient smoothing technique. The fastest of our algorithms solves a linear programming problem with relative accuracy δ in at most e · m1/2 (2 + ln m) · (1 + 1/δ) iterations of a gradient-type scheme, where m is the largest dimension of the problem and e is the Euler number.