Minimum-Euclidean-norm matrix correction for a pair of dual linear programming problems
From MaRDI portal
Publication:1702643
DOI10.1134/S0965542517110148zbMath1397.90268OpenAlexW2769461342MaRDI QIDQ1702643
V. I. Erokhin, A. V. Razumov, A. S. Krasnikov, V. V. Volkov, M. N. Khvostov
Publication date: 28 February 2018
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542517110148
Euclidean normdual pair of linear programming problemsimproper linear programming problemsinverse linear programming problemsminimal matrix correction
Related Items (3)
Extragradient method for correction of inconsistent linear programming problems ⋮ The method of quasi-solutions based on barrier functions in the analysis of improper convex programs ⋮ Regularization and Matrix Correction of Improper Linear Programming Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robustness and correction of linear models
- On optimal zero-preserving corrections for inconsistent linear systems
- Matrix correction of a linear programming problem with inconsistent constraints
- Generalizations of Tikhonov's regularized method of least squares to non-Euclidean vector norms
- Connections between the total least squares and the correction of an infeasible system of linear inequalities
- Minimax matrix correction of inconsistent systems of linear algebraic equations with block matrices of coefficients
- Matrix corrections minimal with respect to the Euclidean norm for linear programming problems
- Consistency and inconsistency radii for solving systems of linear equations and inequalities
- On an inverse linear programming problem
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
- Correction of improper linear programming problems in canonical form by applying the minimax criterion
- Decomposition method in correction problems for inconsistent systems of linear inequalities with partitioned matrices
- Tikhonov solutions of approximately given systems of linear algebraic equations under finite perturbations of their matrices
- 10.1007/s11470-008-1006-6
- Matrix Analysis
- Approximate systems of linear algebraic equations
- Studying the stability of solutions to systems of linear inequalities and constructing separating hyperplanes
- Matrix correction of a dual pair of improper linear programming problems
This page was built for publication: Minimum-Euclidean-norm matrix correction for a pair of dual linear programming problems
