A proximal modified quasi-Newton method for nonsmooth regularized optimization

DOI10.1137/24M169761XMaRDI QIDQ7230409zbMATH OpenFDO

Authors Youssef Diouane, Mohamed Laghdaf Habiboullah, D. Orban

Publication date 17 April 2026

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/24M169761X

zbMATH Keywords

composite optimizationmodified quasi-Newton methodnonconvex optimizationnonsmooth optimizationproximal gradient methodproximal quasi-Newton methodregularized optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Cites work

• A diagonal quasi-Newton updating method for unconstrained optimization
• A generalized proximal point algorithm for certain non-convex minimization problems
• A Levenberg-Marquardt method for nonsmooth regularized least squares
• A local MM subspace method for solving constrained variational problems in image recovery
• A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
• A smoothing proximal gradient algorithm for matrix rank minimization problem
• An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
• An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization
• Convergence properties of monotone and nonmonotone proximal gradient methods revisited
• Efficient regularized proximal quasi-Newton methods for large-scale nonconvex composite optimization problems
• Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
• Forward-backward quasi-Newton methods for nonsmooth optimization problems
• On quasi-Newton forward-backward splitting: proximal calculus and convergence
• On the convergence of a wide range of trust region methods for unconstrained optimization
• On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Proximal gradient methods beyond monotony
• Proximal Newton-type methods for minimizing composite functions
• Sizing and Least-Change Secant Methods
• Some numerical experiments with variable-storage quasi-Newton algorithms
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• The indefinite proximal gradient method
• The Quasi-Cauchy Relation and Diagonal Updating
• Trust Region Methods
• Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
• Variational Analysis

Cited in

(1)

• Nonsmooth exact penalty methods for equality-constrained optimization: complexity and implementation

This page was built for publication: A proximal modified quasi-Newton method for nonsmooth regularized optimization

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