An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions
DOI10.1080/10556788.2022.2142587zbMath1518.65059OpenAlexW4309077610MaRDI QIDQ6175564
Zohre Aminifard, Saman Babaie-Kafaki
Publication date: 24 July 2023
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2022.2142587
nonsmooth optimizationnonmonotone line searchcomposite functionproximal operatorsymmetric rank-one updating formula
Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of quasi-Newton type (90C53) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (1)
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
- A Barzilai-Borwein type method for minimizing composite functions
- A new generalized shrinkage conjugate gradient method for sparse recovery
- On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae
- A coordinate gradient descent method for nonsmooth separable minimization
- Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
- Proximal Newton-Type Methods for Minimizing Composite Functions
- Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
- A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Two-Point Step Size Gradient Methods
- Self-Scaling Variable Metric (SSVM) Algorithms
- Optimal conditioning of self-scaling variable Metric algorithms
- Sparse Reconstruction by Separable Approximation
- First-Order Methods in Optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence
- A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima
- Benchmarking optimization software with performance profiles.
This page was built for publication: An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions
