Adaptive FISTA for Nonconvex Optimization
From MaRDI portal
Publication:5235485
DOI10.1137/17M1156678zbMath1461.65180arXiv1711.04343MaRDI QIDQ5235485
Publication date: 11 October 2019
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.04343
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Methods of quasi-Newton type (90C53)
Related Items (4)
Sparse matrix linear models for structured high-throughput data ⋮ A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations ⋮ Explainable bilevel optimization: an application to the Helsinki Deblur Challenge ⋮ A numerical study of single source localization algorithms for phaseless inverse scattering problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Nonsmooth optimization via quasi-Newton methods
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Variable metric quasi-Fejér monotonicity
- A block coordinate variable metric forward-backward algorithm
- On the limited memory BFGS method for large scale optimization
- Introductory lectures on convex optimization. A basic course.
- A family of variable metric proximal methods
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Nonsmoothness and a variable metric method
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Forward-backward splitting with Bregman distances
- Non-smooth non-convex Bregman minimization: unification and new algorithms
- Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
- Variable Metric Inexact Line-Search-Based Methods for Nonsmooth Optimization
- The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$
- A Majorize-Minimize Subspace Approach for $\ell_2-\ell_0$ Image Regularization
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
- Proximal Splitting Methods in Signal Processing
- A Class of Inexact Variable Metric Proximal Point Algorithms
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- A Variable Metric Proximal Point Algorithm for Monotone Operators
- Convergence Rates in Forward--Backward Splitting
- Geometric numerical integration illustrated by the Störmer–Verlet method
- A Limited Memory Algorithm for Bound Constrained Optimization
- On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence
- On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- A Majorize–Minimize Strategy for Subspace Optimization Applied to Image Restoration
- Signal Recovery by Proximal Forward-Backward Splitting
- Variable metric forward–backward splitting with applications to monotone inclusions in duality
- Some methods of speeding up the convergence of iteration methods
- Quasi-Newton Methods and their Application to Function Minimisation
- IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Adaptive FISTA for Nonconvex Optimization
