Abstract
The paper provides some examples of mutually dual unconstrained optimization problems originating from regularization problems for systems of linear equations and/or inequalities. The solution of each of these mutually dual problems can be found from the solution of the other problem by means of simple formulas. Since mutually dual problems have different dimensions, it is natural to solve the unconstrained optimization problem of the smaller dimension.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
I. I. Eremin, “On quadratic and complete quadratic problems of convex programming,” Russ. Math. (Izv. VUZ) 42(12), 20–26 (1998).
I. I. Eremin, Duality Theory in Linear Optimization (Izd. Yuzhno-Ural’sk. Gos. Univ., Chelyabinsk, 2005) [in Russian].
A. N. Tikhonov, “On ill-posed problems in linear algebra and a stable method for their solution,” Dokl. Akad. Nauk SSSR 163(4), 591–594 (1965).
O. L. Mangasarian, “A finite Newton method for classification,” Optim. Methods Softw. 17(5), 913–929 (2002).
J. M. Ortega and W. C. Reinbolt, Iterative Solution of Nonlinear Equations in Several Variables (Academic, San Diego, 1970; Mir, Moscow, 1975).
A. I. Golikov and Yu. G. Evtushenko, “Finding the projection of a given point on the set of solutions of a linear programming problem,” Proc. Steklov Inst. Math., Suppl. 2, S68–S83 (2008).
A. I. Golikov and Yu. G. Evtushenko, “Generalized Newton method for linear optimization problems with inequality constraints,” Proc. Steklov Inst. Math. 284(Suppl. 1), S96–S107 (2014).
O. L. Mangasarian, Nonlinear Programming (McCrow-Hill, New York, 1969).
A. I. Golikov and Yu. G. Evtushenko, “Theorems on alternatives and their application to numerical methods,” Comp. Math. Math. Phys. 43(3), 338–358 (2003).
I. I. Eremin, Vl. D. Mazurov, and N. N. Astaf’ev, Improper Problems of Linear and Convex Programming (Nauka, Moscow, 1983) [in Russian].
M. Frank and P. Wolfe, “An algorithm for quadratic programming,” Naval Res. Logist. Quart. 3, 95–110 (1956).
A. Albert, Regression and the Moore-Penrose Pseudo-Inverse (Academic, New York, 1972; Nauka, Moscow, 1977).
O. L. Mangasarian, “A Newton method for linear programming,” J. Optim. Theory Appl. 121(1), 1–18 (2004).
C. Kanzow, H. Qi, and L. Qi, “On the minimum norm solution of linear programs,” J. Optim. Theory Appl. 116, 333–345 (2003).
V. A. Garanzha, A. I. Golikov, Yu. G. Evtushenko, and M. Kh. Nguen, “Parallel implementation of Newton’s method for solving large-scale linear programs,” Comp. Math. Math. Phys. 49(8), 1303–1317 (2009).
L. D. Popov, “Quadratic approximation of penalty functions for solving large-scale linear programs,” Comp. Math. Math. Phys. 47(2), 200–214 (2007).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.I. Golikov, Yu.G. Evtushenko, 2014, published in Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2014, Vol. 20, No. 2.
Rights and permissions
About this article
Cite this article
Golikov, A.I., Evtushenko, Y.G. Regularization and normal solutions of systems of linear equations and inequalities. Proc. Steklov Inst. Math. 289 (Suppl 1), 102–110 (2015). https://doi.org/10.1134/S0081543815050090
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0081543815050090