A Barzilai-Borwein type method for minimizing composite functions
From MaRDI portal
Publication:494671
DOI10.1007/s11075-014-9927-8zbMath1321.65099OpenAlexW1973307461MaRDI QIDQ494671
Publication date: 1 September 2015
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-014-9927-8
Related Items
Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization, On the rate of convergence of projected Barzilai–Borwein methods, Approximate ADMM algorithms derived from Lagrangian splitting, An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions, A diagonally scaled Newton-type proximal method for minimization of the models with nonsmooth composite cost functions, A new generalized shrinkage conjugate gradient method for sparse recovery, Accelerated augmented Lagrangian method for total variation minimization
Uses Software
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Gradient methods for minimizing composite functions
- A Barzilai-Borwein type method for stochastic linear complementarity problems
- Linear convergence of iterative soft-thresholding
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
- On the use of the spectral projected gradient method for support vector machines
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming
- Quantitative robust uncertainty principles and optimally sparse decompositions
- R-linear convergence of the Barzilai and Borwein gradient method
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- Projected Barzilai–Borwein method for large-scale nonnegative image restoration
- Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
- Gradient-Based Methods for Sparse Recovery
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- On Sparse Representations in Arbitrary Redundant Bases
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Two-Point Step Size Gradient Methods
- Atomic Decomposition by Basis Pursuit
- Inexact spectral projected gradient methods on convex sets
- Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Sparse Reconstruction by Separable Approximation
- A Nonmonotone Line Search Technique for Newton’s Method
- De-noising by soft-thresholding
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Signal Recovery by Proximal Forward-Backward Splitting
- A variational formulation for frame-based inverse problems
- Compressed sensing
- Adaptive two-point stepsize gradient algorithm
- Unnamed Item
