User menu

Quasi-monotone subgradient methods for nonsmooth convex minimization

Bibliographic reference Nesterov, Yurii ; Shikhman, Vladimir. Quasi-monotone subgradient methods for nonsmooth convex minimization. In: Journal of Optimization Theory and Applications, Vol. 165, no. 3, p. 917-940 (2015)
Permanent URL http://hdl.handle.net/2078.1/152835
  1. Shor Naum Zuselevich, Minimization Methods for Non-Differentiable Functions, ISBN:9783642821202, 10.1007/978-3-642-82118-9
  2. Polyak, B.T.: Introduction to Optimization. Software Inc., New York (1987)
  3. Nemirovsky, A.S., Yudin, D.B.: Problem Complexity and Method Efficiency in Optimization. Wiley, New York (1983)
  4. Mordukhovich B. S., Characterizations of linear suboptimality for mathematical programs with equilibrium constraints, 10.1007/s10107-007-0150-4
  5. Beck Amir, Teboulle Marc, Mirror descent and nonlinear projected subgradient methods for convex optimization, 10.1016/s0167-6377(02)00231-6
  6. Nesterov Yurii, Introductory Lectures on Convex Optimization, ISBN:9781461346913, 10.1007/978-1-4419-8853-9
  7. Rockafellar Ralph Tyrell, Convex Analysis : , ISBN:9781400873173, 10.1515/9781400873173