A gradient projection algorithm with a new stepsize for nonnegative sparsity-constrained optimization
DOI10.1155/2020/6489190zbMATH Open1459.90155OpenAlexW3080772392MaRDI QIDQ2007126FDOQ2007126
Authors: Yanyan Li 
Publication date: 12 October 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/6489190
Recommendations
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- A note on the gradient projection method with exact stepsize rule
- A new gradient projection method with self-adaptive step size
- A conjugate gradient projection method for constrained optimization problems with Wolfe stepsize rule
- A generalized gradient projection algorithm of optimization with nonlinear constraints
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Methods of reduced gradient type (90C52)
Cites Work
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- On solutions of sparsity constrained optimization
- On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
- Greedy sparsity-constrained optimization
- A convergent iterative hard thresholding for nonnegative sparsity optimization
Cited In (7)
- New gradient algorithms for optimization problems constrained by a Cartesian product of unit balls
- Projection algorithms with dynamic stepsize for constrained composite minimization
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
- Greedy sparsity-constrained optimization
- Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic Boolean networks.
- Matrix Optimization Problem Involving Group Sparsity and Nonnegativity Constraints
- A new gradient projection method with self-adaptive step size
This page was built for publication: A gradient projection algorithm with a new stepsize for nonnegative sparsity-constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007126)
