On FISTA with a relative error rule
From MaRDI portal
Publication:2696903
DOI10.1007/s10589-022-00421-8OpenAlexW4308361231MaRDI QIDQ2696903
Nathan Krislock, Yunier Y. Bello Cruz, Max L. N. Gonçalves
Publication date: 17 April 2023
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-022-00421-8
iteration complexityinexact accelerated proximal gradient methodproximal gradient methodFISTAnonsmooth and convex optimization problemsrelative error rule
Convex programming (90C25) Monotone operators and generalizations (47H05) Decomposition methods (49M27) Mathematical programming (90Cxx) Variational and other types of inclusions (47J22)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Gradient methods for minimizing composite functions
- A practical relative error criterion for augmented Lagrangians
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Generating random correlation matrices based on vines and extended onion method
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- Approximate ADMM algorithms derived from Lagrangian splitting
- Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization
- Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
- An inexact proximal generalized alternating direction method of multipliers
- Applying FISTA to optimization problems (with or) without minimizers
- Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms
- A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
- Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
- The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$
- On the convergence of the forward–backward splitting method with linesearches
- A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
- An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods
- Accelerated and Inexact Forward-Backward Algorithms
- Julia: A Fresh Approach to Numerical Computing
- Remark on “algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization”
- On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA
- Just relax: convex programming methods for identifying sparse signals in noise
- LAPACK Users' Guide
- Algorithm 778: L-BFGS-B
- Convergence Rates of Inertial Forward-Backward Algorithms
- An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP
- A preconditioned Newton algorithm for the nearest correlation matrix
- Benchmarking Derivative-Free Optimization Algorithms
- A Note on Performance Profiles for Benchmarking Software
- Convex analysis and monotone operator theory in Hilbert spaces
- Benchmarking optimization software with performance profiles.
