A block-coordinate descent method for linearly constrained minimization problem
From MaRDI portal
Publication:4623697
zbMATH Open1424.90187MaRDI QIDQ4623697FDOQ4623697
Authors: X. F. Liu, Zheng Peng 
Publication date: 22 February 2019
Recommendations
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- An almost cyclic 2-coordinate descent method for singly linearly constrained problems
- A coordinate gradient descent method for nonsmooth separable minimization
- On the convergence of block coordinate descent type methods
- Block coordinate descent for smooth nonconvex constrained minimization
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Linear programming (90C05)
Cited In (11)
- A half-quadratic block-coordinate descent method for spectral estimation.
- Hybrid Jacobian and Gauss-Seidel proximal block coordinate update methods for linearly constrained convex programming
- Title not available (Why is that?)
- A fast active set block coordinate descent algorithm for \(\ell_1\)-regularized least squares
- A cyclic block coordinate descent method with generalized gradient projections
- Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs
- Block coordinate descent for smooth nonconvex constrained minimization
- The blockwise coordinate descent method for integer programs
- On the convergence of inexact block coordinate descent methods for constrained optimization
- Order-reducing conjugate gradients versus block AOR for constrained least-squares problems
- Random block coordinate descent methods for linearly constrained optimization over networks
This page was built for publication: A block-coordinate descent method for linearly constrained minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4623697)
