Barrier subgradient method

Nesterov, Yurii
(2008) , 21 pages

Files

coredp2008_60.pdf
  • Open Access
  • Adobe PDF
  • 468.3 KB
Download

Details

Authors
  • Nesterov, YuriiUCLouvain
    Author
Abstract
In this paper we develop a new primal-dual subgradient method for nonsmooth convex optimization problems. This scheme is based on a self-concordant barrier for the basic feasible set. It is suitable for finding approximate solutions with certain relative accuracy. We discuss some applications of this technique including fractional covering problem, maximal concurrent flow problem, semidefinite relaxations and nonlinear online optimization.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Nesterov, Y. (2008). Barrier subgradient method (CORE Discussion Papers 2008/60). https://hdl.handle.net/2078.5/249862