A solution approach for cardinality minimization problem based on fractional programming

DOI10.1007/S10878-022-00847-0zbMATH Open1498.90166OpenAlexW4212880761MaRDI QIDQ2168753FDOQ2168753

Authors: 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

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

zbMATH Keywords

sparse signalscardinality functioncardinality minimization problemsum-of-ratio problem

Mathematics Subject Classification ID

Fractional programming (90C32) Nonconvex programming, global optimization (90C26)

Cites Work

• Title not available (Why is that?)
• Best subset selection via a modern optimization lens
• Atomic Decomposition by Basis Pursuit
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Overview of total least-squares methods
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Compressed sensing
• De-noising by soft-thresholding
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Solving the sum-of-ratios problem by an interior-point method
• An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
• Sparse Approximate Solutions to Linear Systems
• A note on the complexity of \(L _{p }\) minimization
• Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
• Sparse Regularization via Convex Analysis
• The sparse principal component analysis problem: optimality conditions and algorithms
• Minimum-support solutions of polyhedral concave programs^*
• Exact and approximate sparse solutions of underdetermined linear equations
• A practicable branch and bound algorithm for sum of linear ratios problem
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• Minimization of \(\ell_{1-2}\) for compressed sensing
• A parametric solution method for a generalized fractional programming problem
• Multi-stage convex relaxation for feature selection
• Regional division and reduction algorithm for minimizing the sum of linear fractional functions
• DC formulations and algorithms for sparse optimization problems
• An Efficient algorithm for quadratic sum-of-ratios fractional programs problem
• Range division and linearization algorithm for a class of linear ratios optimization problems
• On solving the sum-of-ratios problem
• Robust investment strategies with discrete asset choice constraints using DC programming
• A practicable contraction approach for the sum of the generalized polynomial ratios problem
• A new iterative firm-thresholding algorithm for inverse problems with sparsity constraints
• Title not available (Why is that?)

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)