Linear-quadratic programming and its application to data correction of improper linear programming problems

Abstract

The problem of maximizing a linear function with linear and quadratic constraints is considered. The solution of the problem is obtained in a constructive form using the Lagrange function and the optimality conditions. Many optimization problems can be reduced to the problem of this type. In this paper, as an application, we consider an improper linear programming problem formalized in the form of maximization of the initial linear criterion with a restriction to the Euclidean norm of the correction vector of the right-hand side of the constraints or the Frobenius norm of the correction matrix of both sides of the constraints.

If the inline PDF is not rendering correctly, you can download the PDF file here.

  • [1] Alizadeh F., Interior point methods in semidenite programming with applications to combinatorial optimization, SIAM Journal on Optimization, 1995, 1(5), 13–51

  • [2] Golub G.N., Van Loan C.F., An analysis of the total least squares problems, SIAM J. Numer. Anal. 1980, 17, 883–893

  • [3] Van Huffel S., Vandewalle J., Algebraic relationships between classical regression and total least-squares estimation, Linear Algebra and its Applications, 1987, 93, 149–160

  • [4] Eremin I.I., Mazurov V.D., Astaf’ev N.N., Improper linear and convex programming problems, Nauka, Moscow, 1983

  • [5] Gorelik V.A., Matrix correction of a linear programming problem with inconsistent constraints, Computational Mathematics and Mathematical Physics, 2001, 11(41), 1615–1622

  • [6] Erohin V.I., Matrix correction of a dual pair of improper linear programming problems, Computational Mathematics and Mathematical Physics, 2007, 47(4), 564–578

  • [7] Gorelik V.A., Zolotova T.V., The problem of linear-quadratic programming. In: Proceedings of 8th International Conference on Optimization and Applications (2-7 October 2017, Petrovac, Montenegro), CEUR-WS, 2017, 1987, 233–238

  • [8] Gorelik V.A., Zolotova T.V., Approximation of the improper linear programming problem with restriction on the norm of the correction matrix of the left-hand side of the constraints, In: Proceedings of 9th International Conference on Optimization and Applications, (1-5 October 2018, Petrovac, Montenegro), DEStech Transactions on Computer Science and Engineering, 2018, 14–24

  • [9] Pardalos P., Vavasis S., Quadratic programming with one negative eigenvalue is NP-hard, Journal of Global Optimization, 1991, 1(1), 15–22

  • [10] Gorelik V.A., Erohin V.I., Optimal matrix correction of inconsistent systems of linear algebraic equations by minimal Euclidean norm, CC RAS, Moscow, 2004

  • [11] Floudas C.A., Pardalos P.M. (Editors), Encyclopedia of Optimization, Springer, Boston, MA, 2009

  • [12] Martein L., Schaible S., On solving a linear program with one quadratic constraint, Decisions in Economics and Finance, 1987, 10(1-2), 75–90

Journal + Issues

Open Computer Science is an open access, peer-reviewed journal. The journal publishes research results in the following fields: algorithms and complexity theory, artificial intelligence, bioinformatics, networking and security systems,
programming languages, system and software engineering, and theoretical foundations of computer science.

Search