The speed of Shor's R-algorithm

IMA Journal of Numerical Analysis

Volumn 28, Issue 4, 2008, Pages 711-720

  Burke, J V ^a   Lewis, A S ^b   Overton, M L ^c  

^a UNIVERSITY OF WASHINGTON   (United States)

^b School of Operations Research and Industrial Engineering   (United States)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

Linear convergence; Nonsmooth optimization; Shor's r algorithm; Space dilation; Unconstrained optimization

Indexed keywords

OPTIMIZATION;

LINEAR CONVERGENCE; NONSMOOTH OPTIMIZATION; SHOR'S R-ALGORITHM; SPACE DILATION; UNCONSTRAINED OPTIMIZATION;

ITERATIVE METHODS;

EID: 55849126369     PISSN: 02724979     EISSN: 14643642     Source Type: Journal    
DOI: 10.1093/imanum/drn008     Document Type: Article

References (8)

1. KAPPEL, F. & KUNTSEVICH, A. (2000) An implementation of Shor's r-algorithm. Comput. Optim. Appl., 15, 193-205.
2. LUENBERGER, D. G. (1984) Linear and Nonlinear Programming. Reading, MA: Addison-Wesley.
3. MERIKOSKI, J. K., URPALA, U., VIRTANEN, A., TAM, T.-Y. & UHLIG, F. (1997) A best upper bound for the 2-norm condition number of a matrix. Linear Algebra Appl., 254, 355-365.
4. POWELL, M. J. D. (1971) On the convergence of the variable metric algorithm. J. Inst. Math. Appl., 7, 21-36.
5. POWELL, M. J. D. (1972) Some properties of the variable metric algorithm. Numerical Methods for Nonlinear Optimization (F. A. Lootsma ed.). London: Academic Press, pp. 1-17.
6. POWELL, M. J. D. (1976) Some global convergence properties of a variable metric algorithm for minimization without exact line searches. Nonlinear Programming. SIAM-AMS Proceedings, vol. IX. Providence, RI: American Mathematical Society, pp. 53-72.
7. SHOR, N. Z. (1985) Minimization Methods for Non-differentiable Functions. New York: Springer.
8. TODD, M. J. (1986) The symmetric rank-one quasi-Newton algorithm is a space-dilation subgradient algorithm. Oper. Res. Lett., 5, 217-219.