Target radius methods for nonsmooth convex optimization
Year of publication: |
November 2017
|
---|---|
Authors: | Oliveira, Welington de |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 45.2017, 6, p. 659-664
|
Subject: | Nonsmooth optimization | Convex optimization | Bundle methods | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
New diagonal bundle method for clustering problems in large data sets
Karmitsa, Napsu, (2017)
-
The descent-ascent algorithm for DC programming
D’Alessandro, Pietro, (2024)
-
Optimality conditions in optimization problems with convex feasible set using convexificators
Kabgani, Alireza, (2017)
- More ...
-
Uncontrolled inexact information within bundle methods
Malick, Jérôme, (2017)
-
Probabilistic optimization via approximate p-efficient points and bundle methods
Ackooij, Wim van, (2017)
-
Ackooij, Wim van, (2018)
- More ...