Faster maximum feasible subsystem solutions for dense constraint matrices

DOI10.1016/J.COR.2021.105633MaRDI QIDQ2669801zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

classificationcompressive sensinglinear programmingmaximum feasible subsystem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

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

• A note on resolving infeasibility in linear programs by constraint relaxation
• A Parametric Optimization Method for Machine Learning
• Active learning for logistic regression: an evaluation
• An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
• Atomic decomposition by basis pursuit
• Branch-and-Cut for the Maximum Feasible Subsystem Problem
• Dimensionality reduction with unsupervised nearest neighbors
• Exact and approximate sparse solutions of underdetermined linear equations
• Fast heuristics for the maximum feasible subsystem problem
• Fast Sparse Representation Based on Smoothed ℓ0 Norm
• Finding the minimum weight IIS cover of an infeasible system of linear inequalities
• scientific article; zbMATH DE number 2186837 (Why is no real title available?)
• scientific article; zbMATH DE number 1215260 (Why is no real title available?)
• scientific article; zbMATH DE number 1342119 (Why is no real title available?)
• Large-scale linear programming techniques for the design of protein folding potentials
• Misclassification minimization
• Models and algorithms for terrestrial digital broadcasting
• Optimal detection of changepoints with a linear computational cost
• Optimization approaches to supervised classification
• Some results concerning post-infeasibility analysis
• Support vector machine active learning with applications to text classification
• The complexity and approximability of finding maximum feasible subsystems of linear relations

Cited in

(6)

• A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
• Fast heuristics for the maximum feasible subsystem problem
• Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem
• A subgradient-based approach for finding the maximum feasible subsystem with respect to a set
• Faster Maximum Feasible Subsystem Solutions for Dense Constraint Matrices
• Cardinality minimization, constraints, and regularization: a survey

Describes a project that uses

Uses Software

• Mosek
• UCI
• PDCO

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)