Some approaches to the solution of optimization problems in supervised learning

DOI10.1134/S0965542515110081zbMath1354.90071MaRDI QIDQ267571

N. N. Katerinochkina

Publication date: 8 April 2016

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

optimizationmaximum feasible subsystemnodal subsystemsystem of linear inequalities

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (1)

The maximum feasible subset problem (maxFS) and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some results concerning post-infeasibility analysis
• 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
• Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem

This page was built for publication: Some approaches to the solution of optimization problems in supervised learning