Descent methods for convex optimization problems in Banach spaces
From MaRDI portal
Summary: We consider optimization problems in Banach spaces, whose cost functions are convex and smooth, but do not possess strengthened convexity properties. We propose a general class of iterative methods, which are based on combining descent and regularization approaches and provide strong convergence of iteration sequences to a solution of the initial problem.
Recommendations
- Inexact descent methods for convex minimization problems in Banach spaces
- Descent methods for equilibrium problems in a Banach space
- Inexact descent methods with convex objective functions in Banach spaces
- Descent methods for convex essentially smooth minimization
- Descent methods for monotone equilibrium problems in Banach spaces
- scientific article; zbMATH DE number 3972657
- Convergence properties of feasible descent methods for solving variational inequalities in Banach spaces
- Convex optimization on Banach spaces
- Descent methods in the presence of computational errors in Banach spaces
- Descent methods with computational errors in Banach spaces
Cited in
(7)- On convergence of descent methods for variational inequalities in a Hilbert space
- Nonsmooth nonconvex global optimization in a Banach space with a basis
- Descent for semiorthogonal decompositions
- The set of divergent descent methods in a Banach space is \(\sigma\)-porous
- Convex optimization on Banach spaces
- Partial linearization method for convex optimization problems in Banach spaces
- scientific article; zbMATH DE number 2208669 (Why is no real title available?)
This page was built for publication: Descent methods for convex optimization problems in Banach spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368348)
