Approximate Bregman proximal gradient algorithm for relatively smooth nonconvex optimization
type: Item
instance of: scholarly article
title: Approximate Bregman proximal gradient algorithm for relatively smooth nonconvex optimization
author: Shota Takahashi
author: Akiko Takeda
published in: Computational Optimization and Applications
publication date: 2025-01-20T00:00:00Z
Mathematics Subject Classification ID: 90Cxx
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7971699
zbMATH Keywords: composite nonconvex nonsmooth optimization
zbMATH Keywords: Bregman proximal gradient algorithms
zbMATH Keywords: Kurdyka-Łojasiewicz property
zbMATH Keywords: \(\ell_p\) regularized least squares problem
zbMATH Keywords: \(\ell_p\) loss problem
zbMATH Keywords: nonnegative linear system
zbMATH Keywords: Kullback-Leibler divergence
MaRDI profile type: Publication
cites work: Sparse and Redundant Representations
cites work: The Elements of Statistical Learning
cites work: Q4864293
cites work: First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
cites work: New Bregman proximal type algoritms for solving DC optimization problems
cites work: Convergence of the alternating minimization algorithm for blind deconvolution
cites work: Rapid, robust, and reliable blind deconvolution via nonconvex optimization
cites work: First-Order Methods in Optimization
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: A generalized proximal point algorithm for certain non-convex minimization problems
cites work: An iterative solution of a variational inequality for certain monotone operators in Hilbert space
cites work: Splitting Algorithms for the Sum of Two Nonlinear Operators
cites work: Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Nonlinear programming and variational inequality problems. A unified approach
cites work: Proximal Newton-Type Methods for Minimizing Composite Functions
cites work: Q3967358
cites work: Q5580053
cites work: An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant
cites work: Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
cites work: Relatively Smooth Convex Optimization by First-Order Methods, and Applications
cites work: A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
cites work: Quartic first-order methods for low-rank minimization
cites work: A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
cites work: Regularized Newton methods for convex minimization problems with singular solutions
cites work: Flexible Krylov Methods for $\ell_p$ Regularization
cites work: Dual Space Preconditioning for Gradient Descent
cites work: Variational Analysis and Applications
cites work: On Information and Sufficiency
cites work: Q4347616
cites work: Matrix Nearness Problems with Bregman Divergences
cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
cites work: On gradients of functions definable in o-minimal structures
cites work: Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: Q5491447
cites work: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
cites work: Phase Retrieval via Wirtinger Flow: Theory and Algorithms
cites work: A Statistical Model for Positron Emission Tomography
cites work: Optimal complexity and certification of Bregman first-order methods
cites work: Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant
DOI: 10.1007/S10589-024-00618-Z
description: scientific article; zbMATH DE number 7971699