Faster maximum feasible subsystem solutions for dense constraint matrices
From MaRDI portal
Publication:2669801
DOI10.1016/j.cor.2021.105633OpenAlexW3214916883MaRDI QIDQ2669801
Sreeraman Rajan, John W. Chinneck, Fereshteh Fakhar Firouzeh
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dimensionality reduction with unsupervised nearest neighbors
- Some results concerning post-infeasibility analysis
- Misclassification minimization
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- 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
- Models and algorithms for terrestrial digital broadcasting
- Optimization approaches to supervised classification
- Large-scale linear programming techniques for the design of protein folding potentials
- A note on resolving infeasibility in linear programs by constraint relaxation
- Active learning for logistic regression: an evaluation
- Atomic Decomposition by Basis Pursuit
- 10.1162/153244302760185243
- Fast Heuristics for the Maximum Feasible Subsystem Problem
- Fast Sparse Representation Based on Smoothed ℓ0 Norm
- Branch-and-Cut for the Maximum Feasible Subsystem Problem
- A Parametric Optimization Method for Machine Learning
- Optimal Detection of Changepoints With a Linear Computational Cost
- Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
This page was built for publication: Faster maximum feasible subsystem solutions for dense constraint matrices
