Quasi-Newton type proximal gradient method for nonconvex nonsmooth composite optimization problems

DOI10.1007/S10898-025-01511-7MaRDI QIDQ6951147zbMATH OpenFDO

Authors Tanxing Wang, Yaning Jiang, Xing-Ju Cai

Publication date 29 July 2025

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10898-025-01511-7

zbMATH Keywords

line searchnonconvex nonsmooth composite optimizationproximal gradient methodquasi-Newton methodvariable metric

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Methods of quasi-Newton type (90C53)

Cites work

• rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
• A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A proximal method for composite minimization
• A variable metric forward-backward method with extrapolation
• Composite optimization by nonconvex majorization-minimization
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Convergence of inexact forward-backward algorithms using the forward-backward envelope
• Convex Analysis
• Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms
• Efficiency of minimizing compositions of convex functions and smooth maps
• Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
• scientific article; zbMATH DE number 3385582 (Why is no real title available?)
• Lectures on convex optimization
• Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
• Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
• On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization
• On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision
• On quasi-Newton forward-backward splitting: proximal calculus and convergence
• Optimization for computer vision. An introduction to core concepts and methods
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Signal Recovery by Proximal Forward-Backward Splitting
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
• Variable metric inexact line-search-based methods for nonsmooth optimization
• Variational Analysis

This page was built for publication: Quasi-Newton type proximal gradient method for nonconvex nonsmooth composite optimization problems

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