An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions

DOI10.1080/10556788.2022.2142587MaRDI QIDQ6175564zbMATH OpenOpenAlexFDO

Authors Zohre Aminifard, Saman Babaie-Kafaki

Publication date 24 July 2023

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2022.2142587

zbMATH Keywords

composite functionnonmonotone line searchnonsmooth optimizationproximal operatorsymmetric rank-one updating formula

Mathematics Subject Classification ID

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)

Recommendations

• Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
• Proximal Newton-type methods for minimizing composite functions
• scientific article; zbMATH DE number 1323073
• scientific article; zbMATH DE number 1146103
• Globalized inexact proximal Newton-type methods for nonconvex composite functions

Cites work

• A Barzilai-Borwein type method for minimizing composite functions
• A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
• A coordinate gradient descent method for nonsmooth separable minimization
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A new generalized shrinkage conjugate gradient method for sparse recovery
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems
• Benchmarking optimization software with performance profiles.
• Convex functions
• First-order methods in optimization
• Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
• Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
• On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae
• On quasi-Newton forward-backward splitting: proximal calculus and convergence
• Optimal conditioning of self-scaling variable Metric algorithms
• Proximal Newton-type methods for minimizing composite functions
• Self-Scaling Variable Metric (SSVM) Algorithms
• Sparse Reconstruction by Separable Approximation
• Two-Point Step Size Gradient Methods

Cited in

(6)

• Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
• A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula
• Proximal Newton-type methods for minimizing composite functions
• A diagonally scaled Newton-type proximal method for minimization of the models with nonsmooth composite cost functions
• A scalar Hessian estimation with a sparse nonmonotone line search technique for the sparse recovery problem
• Global convergence of a proximal memoryless symmetric rank one method for minimizing composite functions

This page was built for publication: An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6175564)