Efficient projected gradient methods for cardinality constrained optimization
From MaRDI portal
Recommendations
- An efficient optimization approach for a cardinality-constrained index tracking problem
- Adaptive projected gradient thresholding methods for constrained \(l_0\) problems
- Algorithm for cardinality-constrained quadratic optimization
- Optimality conditions and numerical methods for a continuous reformulation of cardinality constrained optimization problems
- Optimization problems with cardinality constraints
Cites work
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A hybrid optimization approach to index tracking
- A survey on the continuous nonlinear resource allocation problem
- Adaptive projected gradient thresholding methods for constrained \(l_0\) problems
- Adaptive two-point stepsize gradient algorithm
- An efficient optimization approach for a cardinality-constrained index tracking problem
- An evolutionary heuristic for the index tracking problem.
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Compressed sensing
- Convex programming in Hilbert space
- Greedy sparsity-constrained optimization
- Hard thresholding pursuit: an algorithm for compressive sensing
- Inexact spectral projected gradient methods on convex sets
- Iterative hard thresholding for compressed sensing
- Matching pursuits with time-frequency dictionaries
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the Goldstein-Levitin-Polyak gradient projection method
- On the nonmonotone line search
- Portfolio rebalancing model with transaction costs based on fuzzy decision theory
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse Approximate Solutions to Linear Systems
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- \(R\)-linear convergence of the Barzilai and Borwein gradient method
Cited in
(6)- A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization
- Sparse signal reconstruction: LASSO and cardinality approaches
- Cardinality-constrained structured data-fitting problems
- An efficient optimization approach for a cardinality-constrained index tracking problem
- A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization
- Optimization problems with cardinality constraints
This page was built for publication: Efficient projected gradient methods for cardinality constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1729947)
