Descentwise inexact proximal algorithms for smooth optimization
From MaRDI portal
Recommendations
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- Inexact proximal point algorithms and descent methods in optimization
- On some steplength approaches for proximal algorithms
- An inexact proximal regularization method for unconstrained optimization
- An inexact successive quadratic approximation method for L-1 regularized optimization
Cites work
- A method for the solution of certain non-linear problems in least squares
- A nonsmooth version of Newton's method
- A proximal approach to the inversion of ill-conditioned matrices
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- An effective algorithm for minimization
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convergence Conditions for Ascent Methods
- Convergence of some algorithms for convex minimization
- CUTE
- scientific article; zbMATH DE number 3871040 (Why is no real title available?)
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 1369459 (Why is no real title available?)
- scientific article; zbMATH DE number 3237318 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- Inexact proximal point algorithms and descent methods in optimization
- Minimization of functions having Lipschitz continuous first partial derivatives
- On Convergence Properties of Algorithms for Unconstrained Minimization
- Self-adaptive inexact proximal point methods
- Some numerical experiments with variable-storage quasi-Newton algorithms
- Updating Quasi-Newton Matrices with Limited Storage
- Variable metric bundle methods: From conceptual to implementable forms
Cited in
(19)- On the proximal gradient algorithm with alternated inertia
- Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC
- On the resolution of the variational inequalities of the first and the second kind as equations obtained by explicit Moreau-Yosida regularizations
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- On the convergence of a multigrid method for Moreau-regularized variational inequalities of the second kind
- Algebraic rules for quadratic regularization of Newton's method
- On some steplength approaches for proximal algorithms
- Catalyst acceleration for first-order convex optimization: from theory to practice
- Distributed Learning with Sparse Communications by Identification
- A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes
- An inexact proximal regularization method for unconstrained optimization
- An inexact variable metric proximal point algorithm for generic quasi-Newton acceleration
- Principled analyses and design of first-order methods with inexact proximal operators
- Inexact proximal Newton methods in Hilbert spaces
- A two-metric variable scaled forward-backward algorithm for \(\ell_0\) optimization problem and its applications
- A proximal-gradient method for problems with overlapping group-sparse regularization: support identification complexity
- Two-metric variable scaled splitting algorithm for nonsmooth nonconvex sparsity-penalized quantile regression
- Dual descent methods as tension reduction systems
- A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization
This page was built for publication: Descentwise inexact proximal algorithms for smooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935582)
