Faster maximum feasible subsystem solutions for dense constraint matrices
From MaRDI portal
Publication:2669801
DOI10.1016/J.COR.2021.105633OpenAlexW3214916883MaRDI QIDQ2669801FDOQ2669801
Authors: Fereshteh Fakhar Firouzeh, John W. Chinneck, Sreeraman Rajan 
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.05744
Recommendations
- The maximum feasible subset problem (maxFS) and applications
- scientific article; zbMATH DE number 1342119
- Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
- Fast heuristics for the maximum feasible subsystem problem
Cites Work
- Optimal detection of changepoints with a linear computational cost
- Some results concerning post-infeasibility analysis
- Finding the minimum weight IIS cover of an infeasible system of linear inequalities
- An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
- Optimization approaches to supervised classification
- Title not available (Why is that?)
- Atomic decomposition by basis pursuit
- Support vector machine active learning with applications to text classification
- Large-scale linear programming techniques for the design of protein folding potentials
- Branch-and-Cut for the Maximum Feasible Subsystem Problem
- Title not available (Why is that?)
- Exact and approximate sparse solutions of underdetermined linear equations
- Title not available (Why is that?)
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- Fast Sparse Representation Based on Smoothed ℓ0 Norm
- Misclassification minimization
- Fast heuristics for the maximum feasible subsystem problem
- Dimensionality reduction with unsupervised nearest neighbors
- A note on resolving infeasibility in linear programs by constraint relaxation
- A Parametric Optimization Method for Machine Learning
- Models and algorithms for terrestrial digital broadcasting
- Active learning for logistic regression: an evaluation
Cited In (5)
- Fast heuristics for the maximum feasible subsystem problem
- Cardinality minimization, constraints, and regularization: a survey
- Faster Maximum Feasible Subsystem Solutions for Dense Constraint Matrices
- Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
Uses Software
This page was built for publication: Faster maximum feasible subsystem solutions for dense constraint matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669801)
