Abstract
We study the optimum correction of infeasible systems of linear inequalities through making minimal changes in the coefficient matrix and the right-hand side vector by using the Frobenius norm. It leads to a special structured unconstrained nonlinear and nonconvex problem, which can be reformulated as a one-dimensional parametric minimization problem such that each objective function corresponds to a trust region subproblem.
We show that, under some assumptions, the parametric function is differentiable and strictly unimodal. We present optimally conditions, propose lower and upper bounds on the optimal value and discuss attainability of the optimal value.
To solve the original problem, we propose a binary search method accompanied by a type of Newton-Lagrange method for solving the subproblem. The numerical results illustrate the effectiveness of the suggested method. (C) 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.