Deep block proximal linearized minimization algorithm for nonconvex inverse problems
From MaRDI portal
Image analysis in multivariate analysis (62H35) Nonconvex programming, global optimization (90C26) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Cites work
- scientific article; zbMATH DE number 1817650 (Why is no real title available?)
- scientific article; zbMATH DE number 7585188 (Why is no real title available?)
- rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- 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 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 fast patch-dictionary method for whole image recovery
- A framelet-based image inpainting algorithm
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- A partially inertial customized Douglas-Rachford splitting method for a class of structured optimization problems
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence
- An inertial Newton algorithm for deep learning
- Analysis K-SVD: A Dictionary-Learning Algorithm for the Analysis Sparse Model
- 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
- Convergent plug-and-play with proximal denoiser and unconstrained regularization parameter
- Extrapolated plug-and-play three-operator splitting methods for nonconvex optimization with applications to image restoration
- Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- Gradient methods for minimizing composite functions
- Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
- Inexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization
- Iteration complexity analysis of block coordinate descent methods
- Learning maximally monotone operators for image recovery
- Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- Nonlinear total variation based noise removal algorithms
- Novel proximal gradient methods for nonnegative matrix factorization with sparsity constraints
- Plug-and-Play Unplugged: Optimization-Free Reconstruction Using Consensus Equilibrium
- 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
- Relatively smooth convex optimization by first-order methods, and applications
- Stochastic Gauss-Seidel type inertial proximal alternating linearized minimization and its application to proximal neural networks
- The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than 1/k^2
- Unifying abstract inexact convergence theorems and block coordinate variable metric iPiano
- iPiano: inertial proximal algorithm for nonconvex optimization
Cited in
(1)
This page was built for publication: Deep block proximal linearized minimization algorithm for nonconvex inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6898169)
