Fiche du document
- handle: 10670/1.1ko1i6
- hal: hal-03880925
- doi: 10.1007/s10589-022-00438-z
- WOS: WOS:000912652000001
Ce document est lié à :
info:eu-repo/semantics/altIdentifier/doi/10.1007/s10589-022-00438-z
info:eu-repo/semantics/OpenAccess
Sujets proches
Papers Math Funds Funding Functions, Convex Finance, commerce, confiscations, etcCiter ce document
O P Ferreira et al., « A subgradient method with non-monotone line search », HAL-SHS : économie et finance, ID : 10.1007/s10589-022-00438-z
Métriques
Partage / Export
Résumé
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.