Abstract
A new semi-local convergence analysis of the Gauss–Newton method for solving convex composite optimization problems is presented using the concept of quasi-regularity for an initial point. Our convergence analysis is based on a combination of a center-majorant and a majorant function. The results extend the applicability of the Gauss–Newton method under the same computational cost as in earlier studies using a majorant function or Wang’s condition or Lipchitz condition. The special cases and applications include regular starting points, Robinson’s conditions, Smale’s or Wang’s theory.
Similar content being viewed by others
References
Amat, S., Busquier, S., Gutiérrez, J.M.: Geometric constructions of iterative functions to solve nonlinear equations. J. Comput. Appl. Math. 157, 197–205 (2003)
Argyros, I.K.: Computational theory of iterative methods. In: Chui, K., Wuytack, L. (eds.) Studies in Computational Mathematics, vol. 15. Elsevier, New York (2007)
Argyros, I.K.: Concerning the convergence of Newton’s method and quadratic majorants. J. Appl. Math. Comput. 29, 391–400 (2009)
Argyros, I.K., Hilout, S.: On the Gauss–Newton method. J. Appl. Math. Comput. 35, 537–550 (2011)
Argyros, I.K., Hilout, S.: Extending the applicability of the Gauss–Newton method under average Lipschitz-conditions. Numer. Alg. 58, 23–52 (2011)
Argyros, I.K.: A semilocal convergence analysis for directional Newton methods. Math. Comput. AMS 80, 327–343 (2011)
Argyros, I.K., Cho, Y.J., Hilout, S.: Numerical Methods for Equations and its Applications. CRC Press/Taylor and Francis Group, New York (2012)
Argyros, I.K., Hilout, S.: Improved local convergence of Newton’s method under weaker majorant condition. J. Comput. Appl. Math. 236(7), 1892–1902 (2012)
Argyros, I.K., Hilout, S.: Weaker conditions for the convergence of Newton’s method. J. Complex. 28, 364–387 (2012)
Argyros, I.K.: Hilout, Computational Methods in Nonlinear Analysis. World Scientific Publ. Comp, New Jersey (2013)
Ben-Israel, A., Greville, T.N.E.: Generalized inverses. In: CMS Books in Mathematics/Ouvrages de Mathematiques de la SMC, Theory and Applications, vol. 15, 2nd edn. Springer, New York (2003)
Burke, J.V., Ferris, M.C.: A Gauss–Newton method for convex composite optimization. Math. Progr. Ser A. 71, 179–194 (1995)
Dennis, J.E., Jr., Schnabel, R.B.: Numerical methods for unconstrained optimization and nonlinear equations. Class. Appl. Math., vol. 16. SIAM, Philadelphia (1996)
Ferreira, O.P., Gonçalves, M.L.N., Oliveira, P.R.: Local convergence analysis of the Gauss–Newton method under a majorant condition. J. Complex. 27(1), 111–125 (2011)
Ferreira, O.P., Svaiter, B.F.: Kantorovich’s theorem on Newton’s method in Riemmanian manifolds. J. Complex. 18(1), 304–329 (2002)
Ferreira, O.P., Svaiter, B.F.: Kantorovich’s majorants principle for Newton’s method. Comput. Optim. Appl. 42, 213–229 (2009)
Ferreira, O.P., Gonçalves, M.L.N., Oliveira, P.R.: Convergence of the Gauss–Newton method for convex composite optimization under a majorant condition. SIAM J. Optim. 23(3), 1757–1783 (2013)
Häussler, W.M.: A Kantorovich-type convergence analysis for the Gauss–Newton method. Numer. Math. 48, 119–125 (1986)
Hiriart-Urruty, J.B., Lemaréchal, C.: Convex analysis and minimization algorithms (two volumes). I. Fundamentals. II. In: Advanced Theory and Bundle Methods, vol. 305, 306. Springer, Berlin (1993)
Kantorovich, L.V., Akilov, G.P.: Functional Analysis. Pergamon Press, Oxford (1982)
Li, C., Ng, K.F.: Majorizing functions and convergence of the Gauss–Newton method for convex composite optimization. SIAM J. Optim. 18(2), 613–692 (2007)
Li, C., Wang, X.H.: On convergence of the Gauss–Newton method for convex composite optimization. Math. Program. Ser A. 91, 349–356 (2002)
Potra, F.A.: Sharp error bounds for a class of Newton-like methods. Libertas Mathematica 5, 71–84 (1985)
Robinson, S.M.: Extension of Newton’s method to nonlinear functions with values in a cone. Numer. Math. 19, 341–347 (1972)
Rockafellar, R.T.: Monotone proccesses of convex and concave type. In: Memoirs of the American Mathematical Society, vol. 77. American Mathematical Society, Providence (1967)
Rockafellar, R.T.: Convex analysis. Princeton Mathematical Series, vol. 28. Princeton University Press, Princeton (1970)
Smale, S.: Newton’s method estimates from data at one point. In: The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics (Laramie, Wyo., : 185–196, 1985). Springer, New York (1986)
Wang, X.H.: Convergence of Newton’s method and uniqueness of the solution of equations in Banach space. IMA J. Numer. Anal. 20, 123–134 (2000)
Acknowledgments
The research is supported by the grant MTM2011-28636-C02-01.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Magreñán, Á.A., Argyros, I.K. Expanding the applicability of the Gauss–Newton method for convex optimization under a majorant condition. SeMA 65, 37–56 (2014). https://doi.org/10.1007/s40324-014-0018-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40324-014-0018-5
Keywords
- Gauss–Newton method
- Convex composite optimization problem
- Semi-local convergence
- Majorant function
- Center-majorant function