Global convergence of block Bregman proximal iteratively reweighted algorithm with extrapolation
From MaRDI portal
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Adaptive restart for accelerated gradient schemes
- An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Block Bregman majorization minimization with extrapolation
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Efficiency of minimizing compositions of convex functions and smooth maps
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- First-order methods in optimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- Global convergence of proximal iteratively reweighted algorithm
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Iteration complexity analysis of block coordinate descent methods
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation
- Iteratively reweighted least squares minimization for sparse recovery
- Lower bound theory of nonzero entries in solutions of _2-_p minimization
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Re-examination of Bregman functions and new properties of their divergences
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Relating _p regularization and reweighted _1 regularization
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
This page was built for publication: Global convergence of block Bregman proximal iteratively reweighted algorithm with extrapolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6966828)
