Pages that link to "Item:Q1274926"
From MaRDI portal
The following pages link to On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926):
Displaying 50 items.
- Supervised classification and mathematical optimization (Q339559) (← links)
- Sparse weighted voting classifier selection and its linear programming relaxations (Q436579) (← links)
- Bidirectional heuristic attribute reduction based on conflict region (Q521640) (← links)
- A generalized eigenvalues classifier with embedded feature selection (Q526414) (← links)
- Beyond sparsity: the role of \(L_{1}\)-optimizer in pattern classification (Q650959) (← links)
- On the complexity of deriving position specific score matrices from positive and negative sequences (Q876465) (← links)
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm (Q890292) (← links)
- On the approximability of minmax (regret) network optimization problems (Q976089) (← links)
- A discrete particle swarm optimization method for feature selection in binary classification problems (Q976482) (← links)
- Concave programming for minimizing the zero-norm over polyhedral sets (Q989849) (← links)
- Feature selection with dynamic mutual information (Q1015191) (← links)
- On the hardness of approximating max-satisfy (Q1045886) (← links)
- Sparse high-dimensional fractional-norm support vector machine via DC programming (Q1615094) (← links)
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector (Q1685587) (← links)
- Complexity of minimum irreducible infeasible subsystem covers for flow networks (Q1752598) (← links)
- Sparse regression with exact clustering (Q1952092) (← links)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
- Simultaneous feature selection and clustering based on square root optimization (Q2028812) (← links)
- Fast algorithms for robust principal component analysis with an upper bound on the rank (Q2028928) (← links)
- Robust sparse recovery via a novel convex model (Q2079105) (← links)
- A fixed-point proximity algorithm for recovering low-rank components from incomplete observation data with application to motion capture data refinement (Q2122054) (← links)
- The use of grossone in elastic net regularization and sparse support vector machines (Q2156901) (← links)
- Polarization in cooperative networks through optimal placement of informed agents (Q2164272) (← links)
- A concave optimization-based approach for sparse multiobjective programming (Q2174899) (← links)
- Unsupervised robust discriminative manifold embedding with self-expressiveness (Q2183573) (← links)
- Sparse optimization in feature selection: application in neuroimaging (Q2250090) (← links)
- Iterative reweighted noninteger norm regularizing SVM for gene expression data classification (Q2262318) (← links)
- Sparse regularization for semi-supervised classification (Q2275970) (← links)
- Gene selection via a new hybrid ant colony optimization algorithm for cancer classification in high-dimensional data (Q2283785) (← links)
- Feature selection in SVM via polyhedral \(k\)-norm (Q2300635) (← links)
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit (Q2330942) (← links)
- Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
- A DC programming approach for feature selection in support vector machines learning (Q2442767) (← links)
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem (Q2459384) (← links)
- A new hybrid \(l_p\)-\(l_2\) model for sparse solutions with applications to image processing (Q2691208) (← links)
- Hybrid feature selection algorithm using symmetrical uncertainty and a harmony search algorithm (Q2798460) (← links)
- Using zero-norm constraint for sparse probability density function estimation (Q2935114) (← links)
- Dimensional reduction of nonlinear finite element dynamic models with finite rotations and energy-based mesh sampling and weighting for computational efficiency (Q2952487) (← links)
- Structure-preserving, stability, and accuracy properties of the energy-conserving sampling and weighting method for the hyper reduction of nonlinear finite element dynamic models (Q2952713) (← links)
- Constructing New Weighted <i>ℓ</i><sub>1</sub>-Algorithms for the Sparsest Points of Polyhedral Sets (Q2976140) (← links)
- MAGMA: Multilevel Accelerated Gradient Mirror Descent Algorithm for Large-Scale Convex Composite Minimization (Q3179624) (← links)
- FEATURE TRANSFORMATION: A GENETIC-BASED FEATURE CONSTRUCTION METHOD FOR DATA SUMMARIZATION (Q3224348) (← links)
- A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search (Q3304187) (← links)
- Non-Negative Sparse Regression and Column Subset Selection with L1 Error (Q4993270) (← links)
- Objective Selection for Cancer Treatment: An Inverse Optimization Approach (Q5095171) (← links)
- Convex Optimization for Group Feature Selection in Networked Data (Q5139860) (← links)
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines (Q6051312) (← links)
- A nonlinear kernel SVM Classifier via \(L_{0/1}\) soft-margin loss with classification performance (Q6073171) (← links)
- Multi-objective optimization algorithm based on clustering guided binary equilibrium optimizer and NSGA-III to solve high-dimensional feature selection problem (Q6077079) (← links)
- Representation recovery via \(L_1\)-norm minimization with corrupted data (Q6199567) (← links)
