An adaptive regularization method in Banach spaces
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4011296
- A criterion for convergence of regularization method approximation in Banach spaces
- Regularization methods in Banach spaces.
- scientific article; zbMATH DE number 3858314
- On regularization in Banach spaces
- Regularization in Banach spaces — convergence rates by approximative source conditions
- Adaptive regularization minimization algorithms with nonsmooth norms
- General regularization methods for nonexpansive mappings in Banach spaces
- Regularization by discretization in Banach spaces
- Tikhonov regularization in Banach spaces—improved convergence rates results
Cites work
- A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques
- A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds
- A Mesh-Independence Principle for Operator Equations and Their Discretizations
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization
- Asymptotic Mesh Independence of Newton–Galerkin Methods via a Refined Mysovskii Theorem
- Characteristic inequalities of uniformly convex and uniformly smooth Banach spaces
- Cubic regularization of Newton method and its global performance
- Functional analysis, calculus of variations and optimal control
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- Inequalities in Banach spaces with applications
- Mesh Independence for Nonlinear Least Squares Problems with Norm Constraints
- Numerical Optimization
- On High-order Model Regularization for Constrained Optimization
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization
- On the use of iterative methods in cubic regularization for unconstrained optimization
- On the use of the energy norm in trust-region and adaptive cubic regularization subproblems
- Quasi-Newton Methods and Unconstrained Optimal Control Problems
- Reflexivity and the sup of linear functionals
- Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
- Superlinear Convergence of Affine-Scaling Interior-Point Newton Methods for Infinite-Dimensional Nonlinear Problems with Pointwise Bounds
- Trust Region Methods
- Trust-region and other regularisations of linear least-squares problems
- Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy
- Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
Cited in
(2)
This page was built for publication: An adaptive regularization method in Banach spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6065217)
