Descent methods with computational errors in Banach spaces
From MaRDI portal
Publication:5131813
DOI10.1080/02331934.2019.1576178zbMath1452.90319OpenAlexW2915134982MaRDI QIDQ5131813
Zaslavski, Alexander J., Simeon Reich
Publication date: 9 November 2020
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2019.1576178
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Numerical optimization with computational errors
- On duality gap in linear conic problems
- Optimization on metric and normed spaces
- A generalized projection-based scheme for solving convex constrained optimization problems
- A method of projection onto an acute cone with level control in convex minimization
- Regular vector-fields in Banach spaces
- Genericity in nonlinear analysis
- The Set of Divergent Descent Methods in a Banach Space is \boldmath$\sigma$\unboldmath-Porous
- Generic Convergence of Descent Methods in Banach Spaces
- On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications
- A convergence analysis result for constrained convex minimization problem
- Exterior Distance Function
- On Convergence Properties of a Subgradient Method
- A variational approach to stochastic minimization of convex functionals
- Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
- The method of steepest descent for non-linear minimization problems
This page was built for publication: Descent methods with computational errors in Banach spaces
