Accès à distance ? S'identifier sur le proxy UCLouvain
Quasi-monotone subgradient methods for nonsmooth convex minimization
Primary tabs
Document type | Article de périodique (Journal article) – Article de recherche |
---|---|
Access type | Accès restreint |
Publication date | 2015 |
Language | Anglais |
Journal information | "Journal of Optimization Theory and Applications" - Vol. 165, no. 3, p. 917-940 (2015) |
Peer reviewed | yes |
Publisher | Springer New York LLC ((United States) New York) |
issn | 0022-3239 |
e-issn | 1573-2878 |
Publication status | Publié |
Affiliations |
UCL
- SSH/LIDAM/CORE - Center for operations research and econometrics UCL - SST/ICTM/INMA - Pôle en ingénierie mathématique |
Links |
- Shor Naum Zuselevich, Minimization Methods for Non-Differentiable Functions, ISBN:9783642821202, 10.1007/978-3-642-82118-9
- Polyak, B.T.: Introduction to Optimization. Software Inc., New York (1987)
- Nemirovsky, A.S., Yudin, D.B.: Problem Complexity and Method Efficiency in Optimization. Wiley, New York (1983)
- Mordukhovich B. S., Characterizations of linear suboptimality for mathematical programs with equilibrium constraints, 10.1007/s10107-007-0150-4
- Beck Amir, Teboulle Marc, Mirror descent and nonlinear projected subgradient methods for convex optimization, 10.1016/s0167-6377(02)00231-6
- Nesterov Yurii, Introductory Lectures on Convex Optimization, ISBN:9781461346913, 10.1007/978-1-4419-8853-9
- Rockafellar Ralph Tyrell, Convex Analysis : , ISBN:9781400873173, 10.1515/9781400873173
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 |