A cyclic block coordinate descent method with generalized gradient projections
From MaRDI portal
Publication:1733536
DOI10.1016/j.amc.2016.04.031zbMath1410.90161arXiv1502.06737OpenAlexW2147011436MaRDI QIDQ1733536
Silvia Bonettini, Simone Rebegoldi, Marco Prato
Publication date: 21 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.06737
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items (5)
Simultaneous reconstruction and segmentation with the Mumford-Shah functional for electron tomography ⋮ Block coordinate descent for smooth nonconvex constrained minimization ⋮ A block coordinate variable metric linesearch based proximal gradient method ⋮ Iterative parameter estimation for signal models based on measured data ⋮ On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient gradient method using the Yuan steplength
- On the convergence properties of the projected gradient method for convex optimization
- A limited memory steepest descent method
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
- A convergent least-squares regularized blind deconvolution approach
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Preconditioned iterative regularization in Banach spaces
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- On the convergence of inexact block coordinate descent methods for constrained optimization
- Nonmonotone projected gradient methods based on barrier and Euclidean distances
- Interior projection-like methods for monotone variational inequalities
- A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
- A convergent blind deconvolution method for post-adaptive-optics astronomical imaging
- On spectral properties of steepest descent methods
- A New Semiblind Deconvolution Approach for Fourier-Based Image Restoration: An Application in Astronomy
- Proximal Splitting Methods in Signal Processing
- A discrepancy principle for Poisson data
- Inexact block coordinate descent methods with application to non-negative matrix factorization
- Analysis of an approximate model for Poisson data reconstruction and a related discrepancy principle
- A scaled gradient projection method for constrained image deblurring
- Efficient gradient projection methods for edge-preserving removal of Poisson noise
- Image deblurring with Poisson data: from cells to galaxies
- Two-Point Step Size Gradient Methods
- Globally convergent block-coordinate techniques for unconstrained optimization
- Analysis of bounded variation penalty methods for ill-posed problems
- Inexact spectral projected gradient methods on convex sets
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Nonnegative image reconstruction from sparse Fourier data: a new deconvolution algorithm
- Accelerated gradient methods for the x-ray imaging of solar flares
- Space Variant Blind Image Restoration
- Nonnegative least-squares image deblurring: improved gradient projection approaches
- Blind and Semi-Blind Deblurring of Natural Images
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- On the steepest descent algorithm for quadratic functions
This page was built for publication: A cyclic block coordinate descent method with generalized gradient projections
