An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant
From MaRDI portal
(Redirected from Publication:6166106)
Recommendations
- Inertial proximal alternating minimization for nonconvex and nonsmooth problems
- Alternating structure-adapted proximal gradient descent for nonconvex nonsmooth block-regularized problems
- Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
Cites work
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
- A new hybrid generalized proximal point algorithm for variational inequality problems
- A simplified view of first order methods for optimization
- Alternating structure-adapted proximal gradient descent for nonconvex nonsmooth block-regularized problems
- An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
- Choose your path wisely: gradient descent in a Bregman distance framework
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex Analysis
- Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- scientific article; zbMATH DE number 6508162 (Why is no real title available?)
- Image deblurring with Poisson data: from cells to galaxies
- Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
- Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
- Introductory lectures on convex optimization. A basic course.
- Inverse problems with Poisson data: statistical regularization theory, applications and algorithms
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity
- 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-like incremental aggregated gradient method with linear convergence under Bregman distance growth conditions
- Relatively smooth convex optimization by first-order methods, and applications
- Some methods of speeding up the convergence of iteration methods
Cited in
(10)- Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
- Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
- Non-smooth non-convex Bregman minimization: unification and new algorithms
- Alternating structure-adapted proximal gradient descent for nonconvex nonsmooth block-regularized problems
- A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity
- Approximate Bregman proximal gradient algorithm for relatively smooth nonconvex optimization
- General inertial proximal stochastic mirror descent algorithm beyond Lipschitz smoothness assumption
- A two-step inertial Bregman alternating structure-adapted proximal gradient descent algorithm for nonconvex and nonsmooth problems
- An improved proximal alternating linearized minimization algorithm and its inertial Bregman extension for structured nonconvex nonsmooth optimization problems on Riemannian manifold
- A Bregman ADMM for robust fused Lasso estimation with doubly nonconvex regularizers
This page was built for publication: An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166106)
