Pages that link to "Item:Q3596360"
From MaRDI portal
The following pages link to Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem (Q3596360):
Displaying 9 items.
- Some approaches to the solution of optimization problems in supervised learning (Q267571) (← links)
- Optimization models and algorithms for the hyperplane clustering problem (Q989832) (← links)
- The MIN PFS problem and piecewise linear model estimation (Q1348259) (← links)
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem (Q2459384) (← links)
- Quantile-Based Iterative Methods for Corrupted Systems of Linear Equations (Q5071437) (← links)
- Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions (Q5241241) (← links)
- The maximum feasible subset problem (maxFS) and applications (Q5884385) (← links)
- A deterministic rescaled perceptron algorithm (Q5962726) (← links)
- A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation (Q6592907) (← links)