Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem
From MaRDI portal
Publication:3596360
DOI10.1007/11496915_19zbMath1119.65327OpenAlexW1537526063MaRDI QIDQ3596360
Edoardo Amaldi, Raphael Hauser, Pietro Belotti
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Some approaches to the solution of optimization problems in supervised learning ⋮ The maximum feasible subset problem (maxFS) and applications ⋮ The MIN PFS problem and piecewise linear model estimation ⋮ Quantile-Based Iterative Methods for Corrupted Systems of Linear Equations ⋮ A two-phase relaxation-based heuristic for the maximum feasible subsystem problem ⋮ Optimization models and algorithms for the hyperplane clustering problem ⋮ A deterministic rescaled perceptron algorithm ⋮ Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions
This page was built for publication: Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem
