Gradient iteration with _p-norm constraints
From MaRDI portal
Publication:542878
Recommendations
- Gradient methods with regularization for constrained optimization problems and their complexity estimates
- A conjugate gradient like method for p-norm minimization in functional spaces
- A gradient method for computing the optimal H/sub infinity / norm
- A gradient descent based algorithm for \(\ell_p\) minimization
- Minimizing theL∞Norm of the Gradient with an Energy Constraint
- Gradient projection and conditional gradient methods for constrained nonconvex minimization
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- The Constrained Least Gradient Problem in R n
- Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
Cites work
- Accelerated projected gradient method for linear inverse problems with sparsity constraints
- Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Iterative hard thresholding for compressed sensing
- Iterative thresholding for sparse approximations
- Linear convergence of iterative soft-thresholding
Cited in
(6)- The Constrained Least Gradient Problem in R n
- Wavelet shrinkage estimators of Calderón-Zygmund operators with odd kernels
- Generalization performance of bipartite ranking algorithms with convex losses
- Properties of _p-norm errors in signal recovery
- Minimizing theL∞Norm of the Gradient with an Energy Constraint
- Projected gradient iteration for nonlinear operator equation
This page was built for publication: Gradient iteration with \(\ell _{p}\)-norm constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q542878)