Approximate Bregman proximal gradient algorithm for relatively smooth nonconvex optimization
From MaRDI portal
(Redirected from Publication:6667696)
Cites work
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A generalized proximal point algorithm for certain non-convex minimization problems
- A Statistical Model for Positron Emission Tomography
- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
- An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant
- An iterative solution of a variational inequality for certain monotone operators in Hilbert space
- Bregman proximal point algorithm revisited: a new inexact version and its inertial variant
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Convergence of the alternating minimization algorithm for blind deconvolution
- Convex analysis and monotone operator theory in Hilbert spaces
- Dual space preconditioning for gradient descent
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- First-order methods in optimization
- Flexible Krylov methods for \(\ell_p\) regularization
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 1046019 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- Matrix Nearness Problems with Bregman Divergences
- Monotone Operators and the Proximal Point Algorithm
- New Bregman proximal type algoritms for solving DC optimization problems
- Nonlinear programming and variational inequality problems. A unified approach
- On gradients of functions definable in o-minimal structures
- On Information and Sufficiency
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Optimal complexity and certification of Bregman first-order methods
- Phase retrieval via Wirtinger flow: theory and algorithms
- 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
- Proximal Newton-type methods for minimizing composite functions
- Quartic first-order methods for low-rank minimization
- Rapid, robust, and reliable blind deconvolution via nonconvex optimization
- Regularized Newton methods for convex minimization problems with singular solutions
- Relatively smooth convex optimization by first-order methods, and applications
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The Elements of Statistical Learning
- Variational analysis and applications
Cited in
(3)
This page was built for publication: Approximate Bregman proximal gradient algorithm for relatively smooth nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6667696)
