A gradient projection algorithm with a new stepsize for nonnegative sparsity-constrained optimization

DOI10.1155/2020/6489190zbMath1459.90155OpenAlexW3080772392MaRDI QIDQ2007126

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

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Methods of reduced gradient type (90C52)

Cites Work

• On solutions of sparsity constrained optimization
• On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms
• Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
• Sparse and Redundant Representations
• Greedy Sparsity-Constrained Optimization
• Unnamed Item

This page was built for publication: A gradient projection algorithm with a new stepsize for nonnegative sparsity-constrained optimization