论文信息 - Unconstrained Convex Minimization in Relative Scale

Unconstrained Convex Minimization in Relative Scale

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.

Yurii Nesterov | Y. Nesterov

[1] Yurii Nesterov,et al. Smooth minimization of non-smooth functions , 2005, Math. Program..

[2] Daniel Bienstock,et al. Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice , 2002 .

[3] J. Hiriart-Urruty,et al. Convex analysis and minimization algorithms , 1993 .

[4] Yurii Nesterov,et al. Introductory Lectures on Convex Optimization - A Basic Course , 2014, Applied Optimization.

[5] Arkadi Nemirovski,et al. Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[6] John Darzentas,et al. Problem Complexity and Method Efficiency in Optimization , 1983 .

[7] Leonid Khachiyan,et al. Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints , 1994, SIAM J. Optim..

[8] Yurii Nesterov,et al. Excessive Gap Technique in Nonsmooth Convex Minimization , 2005, SIAM J. Optim..

[9] Éva Tardos,et al. Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.