Adaptive regularization minimization algorithms with nonsmooth norms
From MaRDI portal
Recommendations
- Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization
- Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives
- Adaptive Alternating Minimization Algorithms
- Adaptive smoothing algorithms for nonsmooth composite convex minimization
- Iterative implementation of the adaptive regularization yields optimality
- Nearly optimal first-order methods for convex optimization under gradient norm measure: an adaptive regularization approach
- Adaptive complexity regularization for linear inverse problems
- An adaptive primal-dual framework for nonsmooth convex minimization
- An adaptive regularization method in Banach spaces
- Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods
Cited in
(10)- Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization
- Strong local convergence properties of adaptive regularized methods for nonlinear least squares
- An adaptive regularization method in Banach spaces
- Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an \(\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}\) Complexity Bound
- Adaptive Regularization Minimization Algorithms with Non-Smooth Norms and Euclidean Curvature
- Second-order methods for quartically-regularised cubic polynomials, with applications to high-order tensor methods
- Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is \(o(\epsilon^{-2})\) rather than \(\mathcal{O}(\epsilon^{-2})\)
- Yet another fast variant of Newton's method for nonconvex optimization
- A stochastic objective-function-free adaptive regularization method with optimal complexity
- An optimally fast objective-function-free minimization algorithm using random subspaces
This page was built for publication: Adaptive regularization minimization algorithms with nonsmooth norms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5887492)
