Efficient projected gradient methods for cardinality constrained optimization

DOI10.1007/s11425-016-9124-0zbMath1409.90227OpenAlexW2800075534MaRDI QIDQ1729947

Zhihu Zhao, Feng-Min Xu, Zong Ben Xu, Yu-Hong Dai

Publication date: 7 March 2019

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-016-9124-0

zbMATH Keywords

global convergencesignal recoverysparse approximationprojected gradient methodindex tracking

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Methods of reduced gradient type (90C52)

Related Items

A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization

Uses Software

• OR-Library
• CoSaMP

Cites Work

• Unnamed Item
• Iterative hard thresholding for compressed sensing
• Adaptive projected gradient thresholding methods for constrained \(l_0\) problems
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• A hybrid optimization approach to index tracking
• An evolutionary heuristic for the index tracking problem.
• Portfolio rebalancing model with transaction costs based on fuzzy decision theory
• A survey on the continuous nonlinear resource allocation problem
• New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
• R-linear convergence of the Barzilai and Borwein gradient method
• An efficient optimization approach for a cardinality-constrained index tracking problem
• Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
• Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Two-Point Step Size Gradient Methods
• On the Goldstein-Levitin-Polyak gradient projection method
• Inexact spectral projected gradient methods on convex sets
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• Sparse Approximate Solutions to Linear Systems
• Matching pursuits with time-frequency dictionaries
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
• Greedy Sparsity-Constrained Optimization
• Convex programming in Hilbert space
• Compressed sensing
• Adaptive two-point stepsize gradient algorithm
• On the nonmonotone line search