Efficient projected gradient methods for cardinality constrained optimization
type: Item
instance of: scholarly article
title: Efficient projected gradient methods for cardinality constrained optimization
zbMATH Open document ID: 1409.90227
author: Zhihu Zhao
author: Feng-Min Xu
author: Yuhong Dai
author: Zongben Xu
published in: Science China. Mathematics
publication date: 2019-03-07T00:00:00Z
Mathematics Subject Classification ID: 90C52
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7033401
zbMATH Keywords: sparse approximation
zbMATH Keywords: projected gradient method
zbMATH Keywords: global convergence
zbMATH Keywords: signal recovery
zbMATH Keywords: index tracking
describes a project that uses: OR-Library
describes a project that uses: CoSaMP
MaRDI profile type: Publication
full work available at URL: s11425-016-9124-0
OpenAlex ID: W2800075534
cites work: Greedy Sparsity-Constrained Optimization
cites work: Two-Point Step Size Gradient Methods
cites work: Q3932576
cites work: An evolutionary heuristic for the index tracking problem.
cites work: Sparsity constrained nonlinear optimization: optimality conditions and algorithms
cites work: On the Goldstein-Levitin-Polyak gradient projection method
cites work: Nonmonotone Spectral Projected Gradient Methods on Convex Sets
cites work: Inexact spectral projected gradient methods on convex sets
cites work: Iterative hard thresholding for compressed sensing
cites work: Subspace Pursuit for Compressive Sensing Signal Reconstruction
cites work: On the nonmonotone line search
cites work: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
cites work: \(R\)-linear convergence of the Barzilai and Borwein gradient method
cites work: Adaptive two-point stepsize gradient algorithm
cites work: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
cites work: Compressed sensing
cites work: Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
cites work: Portfolio rebalancing model with transaction costs based on fuzzy decision theory
cites work: Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
cites work: Convex programming in Hilbert space
cites work: A Nonmonotone Line Search Technique for Newton’s Method
cites work: Matching pursuits with time-frequency dictionaries
cites work: Sparse Approximate Solutions to Linear Systems
cites work: CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
cites work: A survey on the continuous nonlinear resource allocation problem
cites work: The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
cites work: A hybrid optimization approach to index tracking
cites work: Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
cites work: An efficient optimization approach for a cardinality-constrained index tracking problem
cites work: A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
cites work: Adaptive projected gradient thresholding methods for constrained \(l_0\) problems
DOI: 10.1007/S11425-016-9124-0
description: scientific article; zbMATH DE number 7033401