Smoothing technique in Structural Optimization

Preprints

• Yu. Nesterov. Rounding of convex sets and efficient gradient methods for linear programming problems. CORE Discussion Paper #2004/4. Sent to OMS, (pdf).
• Yu. Nesterov. Unconstrained convex minimization in relative scale. CORE Discussion Paper #2003/96. Sent to MOR, (pdf).

Papers in journals

• Yu. Nesterov. Smoothing technique and its applications in semidefinite optimization. CORE DP 2004/73. Accepted by Mathematical Programming, (pdf).
• Yu. Nesterov. Excessive gap technique in nonsmooth convex minimization. SIOPT 16(1), 235-249 (2005), (pdf).
• Yu. Nesterov. Smooth minimization of non-smooth functions. Mathematical Programming, 103(1), 127-152 (2005), (pdf).

Related results in the past

• Yu. Nesterov. Introductory lectures on Convex Optimization. A basic course. Kluwer, Boston 2004, (Section 2)
• Yu. Nesterov. A method for solving a convex programming problem with convergence rate 1/k^2. Soviet Math. Dokl. 27(2), 372-376 (1983), (pdf).