A solution approach for cardinality minimization problem based on fractional programming
From MaRDI portal
Publication:2168753
DOI10.1007/s10878-022-00847-0zbMath1498.90166OpenAlexW4212880761MaRDI QIDQ2168753
S. M. Mirhadi, S. A. MirHassani
Publication date: 26 August 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00847-0
Cites Work
- Unnamed Item
- Unnamed Item
- Overview of total least-squares methods
- Best subset selection via a modern optimization lens
- The sparse principal component analysis problem: optimality conditions and algorithms
- A practicable branch and bound algorithm for sum of linear ratios problem
- A note on the complexity of \(L _{p }\) minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Solving the sum-of-ratios problem by an interior-point method
- Range division and linearization algorithm for a class of linear ratios optimization problems
- DC formulations and algorithms for sparse optimization problems
- A parametric solution method for a generalized fractional programming problem
- A new iterative firm-thresholding algorithm for inverse problems with sparsity constraints
- On solving the sum-of-ratios problem
- A practicable contraction approach for the sum of the generalized polynomial ratios problem
- Multi-stage convex relaxation for feature selection
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Robust investment strategies with discrete asset choice constraints using DC programming
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Atomic Decomposition by Basis Pursuit
- Minimum-support solutions of polyhedral concave programs*
- An Efficient Algorithm for Quadratic Sum-of-Ratios Fractional Programs Problem
- Sparse Regularization via Convex Analysis
- Sparse Approximate Solutions to Linear Systems
- De-noising by soft-thresholding
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Compressed sensing
This page was built for publication: A solution approach for cardinality minimization problem based on fractional programming