Two iterative processes generated by regular vector fields in Banach spaces

DOI10.1080/02331934.2020.1865348MaRDI QIDQ5077153zbMATH OpenOpenAlexFDO

Authors Alexander J. Zaslavski, Simeon Reich

Publication date 18 May 2022

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2020.1865348

zbMATH Keywords

convex functionBanach spacecomplete metric spacedescent methoditerative process

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Convexity of real functions of several variables, generalizations (26B25)

Recommendations

• Descent methods in the presence of computational errors in Banach spaces
• Descent methods with computational errors in Banach spaces
• Inexact descent methods with convex objective functions in Banach spaces
• Inexact descent methods for convex minimization problems in Banach spaces
• scientific article; zbMATH DE number 7347554

Cites work

• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• 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
• A variational approach to stochastic minimization of convex functionals
• Convergence analysis of augmented Lagrangian-fast projected gradient method for convex quadratic problems
• Descent methods with computational errors in Banach spaces
• Exterior distance function
• Generic convergence of descent methods in Banach spaces
• Genericity in nonlinear analysis
• Numerical optimization with computational errors
• On Convergence Properties of a Subgradient Method
• On Lagrange multipliers in convex entropy minimization
• On convergence rates of linearized proximal algorithms for convex composite optimization with applications
• Optimization on metric and normed spaces
• Regular vector-fields in Banach spaces
• The method of steepest descent for non-linear minimization problems
• The set of divergent descent methods in a Banach space is \(\sigma\)-porous
• Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone

Cited in

(4)

• Descent methods with computational errors in Banach spaces
• Inexact descent methods with convex objective functions in Banach spaces
• Inexact descent methods for convex minimization problems in Banach spaces
• Descent methods in the presence of computational errors in Banach spaces

This page was built for publication: Two iterative processes generated by regular vector fields in Banach spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5077153)