Regularized Newton method for unconstrained convex optimization

Mathematical Programming

Volumn 120, Issue 1 SPEC. ISS., 2009, Pages 125-145

  Polyak, Roman A ^a  

^a GEORGE MASON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX FUNCTIONS; OPTIMAL SETS; QUADRATIC RATES; REGULARIZED NEWTON METHODS;

NEWTON-RAPHSON METHOD; OPTIMIZATION;

CONVEX OPTIMIZATION;

EID: 65249101213     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-007-0143-3     Document Type: Article

References (11)

1. Y.M. Ermoliev 1966 Methods for solving nonlinear extremal problems (in Russian) Kibernetika 4 1 17
2. L.V. Kantorovich 1948 Functional analysis and applied mathematics (in Russian) Uspekhi Mat. Nauk 3 89 185
3. K. Levenberg 1944 A method for the solution of certain nonlinear problems in least squares Q. Appl. Math. 2 164 168
4. D. Marquardt 1963 An algorithm for least-squares estimation of nonlinear parameters J. Soc. Ind. Appl. Math. 11 431 441
5. Nesterov Y. and Nemirovsky A. (1994). Interior Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia
6. Nesterov, Y., Polyak, B.T.: Cubic Regularization of Newton Method and its Global Performance. Mathematical Programming. DOI 10.1007/s 10107-006-0706-8, published online 04/25/06
7. B.T. Polyak 1963 Gradient methods for the minimization of functionals USSR Comp. Math. and Math. Phys. 3 4 643 653
8. B.T. Polyak 1967 A general method of solving extremum problems Sov. Math. Dokl. 3 593 597
9. Polyak B.T. (1987). Introduction to Optimization. Optimization Software, New York
10. Shor N.Z. (1998). Nondifferentiable Optimization and Polynomial Problems. Kluwer, Boston
11. Smale S. (1986). Newton's method estimates from data at one point. In: Ewing, R.E., Gross, K.I. and Martin, C.F. (eds) The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics, pp 185-196. Springer, New York