A solution approach for cardinality minimization problem based on fractional programming
From MaRDI portal
Publication:2168753
Recommendations
- A proximal point algorithm for generalized fractional programs
- Minimization of the ratio of functions defined as sums of the absolute values
- scientific article; zbMATH DE number 6179040
- A new linearization technique for minimax linear fractional programming
- A polynomial time approximation algorithm for linear fractional programs
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 7696514 (Why is no real title available?)
- A new iterative firm-thresholding algorithm for inverse problems with sparsity constraints
- A note on the complexity of \(L _{p }\) minimization
- A parametric solution method for a generalized fractional programming problem
- A practicable branch and bound algorithm for sum of linear ratios problem
- A practicable contraction approach for the sum of the generalized polynomial ratios problem
- An Efficient algorithm for quadratic sum-of-ratios fractional programs problem
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Atomic Decomposition by Basis Pursuit
- Best subset selection via a modern optimization lens
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Compressed sensing
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- DC formulations and algorithms for sparse optimization problems
- De-noising by soft-thresholding
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Exact and approximate sparse solutions of underdetermined linear equations
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Minimum-support solutions of polyhedral concave programs*
- Multi-stage convex relaxation for feature selection
- On solving the sum-of-ratios problem
- Overview of total least-squares methods
- Range division and linearization algorithm for a class of linear ratios optimization problems
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions
- Robust investment strategies with discrete asset choice constraints using DC programming
- Solving the sum-of-ratios problem by an interior-point method
- Sparse Approximate Solutions to Linear Systems
- Sparse Regularization via Convex Analysis
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- The sparse principal component analysis problem: optimality conditions and algorithms
This page was built for publication: A solution approach for cardinality minimization problem based on fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168753)
