A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems
Year of publication: |
2019
|
---|---|
Authors: | Loreto, M. ; Xu, Y. ; Kotval, D. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 104.2019, p. 90-97
|
Subject: | Nonsmooth optimization | Subgradient methods | Spectral gradient methods | Nonmonotone line search | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
An optimal subgradient algorithm for large-scale bound-constrained convex optimzation
Ahookhosh, Masoud, (2017)
-
Solving structured nonsmooth convex optimization with complexity O(ε−1/2)
Ahookhosh, Masoud, (2018)
-
Robustness in nonsmooth nonlinear multi-objective programming
Zamani, Moslem, (2015)
- More ...
-
Essays on the theories of trade and growth
Xu, Yingfeng, (1990)
-
COMPETITION OF SERVICE MARKETPLACES – DESIGNINGGROWTH IN SERVICE NETWORKS
Conte, T., (2010)
-
The tradeoff between growth and equity in decentralization policy : China's experience
Qiao, Baoyun, (2008)
- More ...