Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives
From MaRDI portal
Publication:5231684
DOI10.1137/17M1149390zbMath1427.90215arXiv1709.09004WikidataQ127566975 ScholiaQ127566975MaRDI QIDQ5231684
Luca Calatroni, Antonin Chambolle
Publication date: 27 August 2019
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.09004
Ill-posedness and regularization problems in numerical linear algebra (65F22) Convex programming (90C25)
Related Items
Additive Schwarz methods for convex optimization with backtracking ⋮ A scaled and adaptive FISTA algorithm for signal-dependent sparse image super-resolution problems ⋮ An Optimized Dynamic Mode Decomposition Model Robust to Multiplicative Noise ⋮ Improving “Fast Iterative Shrinkage-Thresholding Algorithm”: Faster, Smarter, and Greedier ⋮ Fast gradient methods for uniformly convex and weakly smooth problems ⋮ Convergence rate of inertial proximal algorithms with general extrapolation and proximal coefficients ⋮ Linearly-convergent FISTA variant for composite optimization with duality ⋮ An abstract convergence framework with application to inertial inexact forward-backward methods ⋮ A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization ⋮ Compressive Computed Tomography Reconstruction through Denoising Approximate Message Passing ⋮ Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions ⋮ Accelerated variational PDEs for efficient solution of regularized inversion problems ⋮ Scaled, Inexact, and Adaptive Generalized FISTA for Strongly Convex Optimization ⋮ An Optimal High-Order Tensor Method for Convex Optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Gradient methods for minimizing composite functions
- Fast first-order methods for composite convex optimization with backtracking
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Introductory lectures on convex optimization. A basic course.
- An algorithm for total variation minimization and applications
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
- Adaptive restart for accelerated gradient schemes
- Minimization of functions having Lipschitz continuous first partial derivatives
- A Variable Metric Forward-Backward Method with Extrapolation
- Accelerated and Inexact Forward-Backward Algorithms
- Local Linear Convergence of ISTA and FISTA on the LASSO Problem
- Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA
- New Proximal Point Algorithms for Convex Minimization
- An Accelerated Composite Gradient Method for Large-Scale Composite Objective Problems
- Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- A Generalized Accelerated Composite Gradient Method: Uniting Nesterov's Fast Gradient Method and FISTA
- Regularization and Variable Selection Via the Elastic Net
- First Order Algorithms in Variational Image Processing
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Signal Recovery by Proximal Forward-Backward Splitting
- Convex programming in Hilbert space
- An introduction to continuous optimization for imaging
