Inexact descent methods for convex minimization problems in Banach spaces
Keyword(s):
"Given a Lipschitz and convex objective function of an unconstrained optimization problem, defined on a Banach space, we revisit the class of regular vector fields which was introduced in our previous work on descent methods. We study, in particular, the asymptotic behavior of the sequence of values of the objective function for a certain inexact process generated by a regular vector field when the sequence of computational errors converges to zero and show that this sequence of values converges to the infimum of the given objective function of the unconstrained optimization problem."
2019 ◽
Vol 38
(4)
◽
2002 ◽
Vol 29
(14)
◽
pp. 2087-2091
◽
2020 ◽
Vol 34
(09)
◽
pp. 13620-13621
2018 ◽
Vol 332
◽
pp. 012024
◽
1976 ◽
Vol 16
(3)
◽
pp. 40-51
2003 ◽
Vol 02
(01)
◽
pp. 41-70
◽