Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem

DOI10.1007/11496915_19MaRDI QIDQ3596360zbMATH OpenOpenAlexFDO

Authors E. Amaldi, Pietro Belotti, Raphael A. Hauser

Publication date 30 August 2007

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11496915_19

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Linear programming (90C05) Randomized algorithms (68W20)

Recommendations

• A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
• scientific article; zbMATH DE number 1342119
• The maximum feasible subset problem (maxFS) and applications
• Faster maximum feasible subsystem solutions for dense constraint matrices
• Branch-and-Cut for the Maximum Feasible Subsystem Problem

Cited in

(10)

• Faster maximum feasible subsystem solutions for dense constraint matrices
• Quantile-based iterative methods for corrupted systems of linear equations
• A deterministic rescaled perceptron algorithm
• A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation
• Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions
• The maximum feasible subset problem (maxFS) and applications
• Optimization models and algorithms for the hyperplane clustering problem
• The MIN PFS problem and piecewise linear model estimation
• A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
• Some approaches to the solution of optimization problems in supervised learning

This page was built for publication: Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596360)