A subgradient method with non-monotone line search
O. P. Ferreira (),
G. N. Grapiglia (),
E. M. Santos () and
J. C. O. Souza ()
Additional contact information
O. P. Ferreira: Universidade Federal de Goiás
G. N. Grapiglia: Université Catholique de Louvain
E. M. Santos: Instituto Federal de Educação, Ciência e Tecnologia do Maranhão
J. C. O. Souza: Aix-Marseille University
Computational Optimization and Applications, 2023, vol. 84, issue 2, No 4, 397-420
Abstract In this paper we present a subgradient method with non-monotone line search for the minimization of convex functions with simple convex constraints. Different from the standard subgradient method with prefixed step sizes, the new method selects the step sizes in an adaptive way. Under mild conditions asymptotic convergence results and iteration-complexity bounds are obtained. Preliminary numerical results illustrate the relative efficiency of the proposed method.
Keywords: Subgradient method; Non-monotone line search; Convex function (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
http://link.springer.com/10.1007/s10589-022-00438-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:84:y:2023:i:2:d:10.1007_s10589-022-00438-z
Ordering information: This journal article can be ordered from
Access Statistics for this article
Computational Optimization and Applications is currently edited by William W. Hager
More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().