Inexact Newton Method for Minimization of Convex Piecewise Quadratic Functions

  • Alexander I. Golikov
  • Igor E. KaporinEmail author
Conference paper
Part of the Lecture Notes in Computational Science and Engineering book series (LNCSE, volume 131)


An inexact Newton type method for numerical minimization of convex piecewise quadratic functions is considered and its convergence is analyzed. Earlier, a similar method was successfully applied to optimization problems arising in numerical grid generation. The method can be applied for computing a minimum norm nonnegative solution of underdetermined system of linear equations or for finding the distance between two convex polyhedra. The performance of the method is tested using sample data from NETLIB family of the University of Florida sparse matrix collection as well as quasirandom data.



This work was partially supported by the Russian Foundation for Basic Research grant No. 17-07-00510. The authors are grateful to the anonymous referees and to Prof. V. Garanzha for many useful comments which greatly improved the exposition of the paper.


  1. 1.
    Axelsson, O.: A class of iterative methods for finite element equations. Comput. Methods Appl. Mech. Eng. 9, 123–137 (1976)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Axelsson, O., Kaporin, I.E.: Error norm estimation and stopping criteria in preconditioned conjugate gradient iterations. Numer. Linear Algebra Appl. 8(4), 265–286 (2001)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Bobrow, J.E.: A direct minimization approach for obtaining the distance between convex polyhedra. Int. J. Robot. Res. 8(3), 65–76 (1989)CrossRefGoogle Scholar
  4. 4.
    Dongarra, J., Eijkhout, V.: Finite-choice algorithm optimization in Conjugate Gradients. Lapack Working Note 159, University of Tennessee Computer Science Report UT-CS-03–502 (2003)Google Scholar
  5. 5.
    Ganin, B.V., Golikov, A.I., Evtushenko, Y.G.: Projective-dual method for solving systems of linear equations with nonnegative variables. Comput. Math. Math. Phys. 58(2), 159–169 (2018)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Garanzha, V.A., Kaporin, I.E.: Regularization of the barrier variational method of grid generation. Comput. Math. Math. Phys. 39(9), 1426–1440 (1999)MathSciNetzbMATHGoogle Scholar
  7. 7.
    Garanzha, V., Kaporin, I., Konshin, I.: Truncated Newton type solver with application to grid untangling problem. Numer. Linear Algebra Appl. 11(5–6), 525–533 (2004)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Garanzha, V.A., Golikov, A.I., Evtushenko, Y.G., Nguen, M.K.: Parallel implementation of Newton’s method for solving large-scale linear programs. Comput. Math. Math. Phys. 49(8), 1303–1317 (2009)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Hestenes, M.R., Stiefel, E.L.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. 49(1), 409–436 (1952)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Hiriart-Urruty, J.B., Strodiot, J.J., Nguyen, V.H.: Generalized Hessian matrix and second-order optimality conditions for problems with C 1, 1 data. Appl. Math. Optim. 11(1), 43–56 (1984)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Kaporin, I.E.: Using inner conjugate gradient iterations in solving large-scale sparse nonlinear optimization problems. Comput. Math. Math. Phys. 43(6), 766–771 (2003)MathSciNetGoogle Scholar
  12. 12.
    Kaporin, I.E., Axelsson, O.: On a class of nonlinear equation solvers based on the residual norm reduction over a sequence of affine subspaces. SIAM J. Sci. Comput. 16(1), 228–249 (1995)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Kaporin, I.E., Milyukova, O.Y.: The massively parallel preconditioned conjugate gradient method for the numerical solution of linear algebraic equations. In: Zhadan, V.G. (ed.) Collection of Papers of the Department of Applied Optimization of the Dorodnicyn Computing Center, pp. 132–157, Russian Academy of Sciences, Moscow (2011)Google Scholar
  14. 14.
    Ketabchi, S., Moosaei, H., Parandegan, M., Navidi, H.: Computing minimum norm solution of linear systems of equations by the generalized Newton method. Numer. Algebra Control Optim. 7(2), 113–119 (2017)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Mangasarian, O.L.: A finite Newton method for classification. Optim. Methods Softw. 17(5), 913–929 (2002)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Mangasarian, O.L.: A Newton method for linear programming. J. Optim. Theory Appl. 121(1), 1–18 (2004)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Yu, L., Barbot, J.P., Zheng, G., Sun, H.: Compressive sensing with chaotic sequence. IEEE Signal Process Lett. 17(8), 731–734 (2010)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Dorodnicyn Computing Center of FRC CSC RASMoscowRussia
  2. 2.Moscow Institute of Physics and Technology (State University)Dolgoprudny, MoscowRussia

Personalised recommendations