D. F. Shanno
- 1 BRODLIE, K.W. An assessment of two approaches to variable metric methods. Math. Program. 12 (1977), 334-355.Google Scholar
- 2 FLETCHER, R., AND POWELL, M.J.D. A rapidly convergent descent method for minimization. Comput. J. 6 (1963), 163-168.Google Scholar
- 3 HIMMELBLAU, D.M. Applied Nonhnear Programming. McGraw-Hill, New York, 1972.Google Scholar
- 4 MORE, J J., GARBOW, B.S., AND HILLSTROM, K.E. Testing unconstrained m~mmizatlon software TM-324, Appl. Math. Dlv, Argonne National Lab., Argonne, Ill., 1978.Google Scholar
- 5 ORES, S.S. Self-scaling variable metric algorithm. Part II. Manage. Sci 20 (1974), 863-874.Google Scholar
- 6 POWELL, M.J.D. Some global convergence properties of a variable metric algorithm for minimization without exact line searches, in Nonhnear Programming, R.W. Cottle and C.E. Lemke, Eds., American Mathematical Soc, Providence, R.I., 1976Google Scholar
- 7 SHAI~NO, D.F. Conjugate gradient methods with inexact searches. Math. Oper. Res. 3 (1978), 244-256.Google Scholar
- 8 SHANNO, D.F. On the convergence of a new conjugate gradient method. SIAM. J Numer Anal 15 (1978), 1247-1257.Google Scholar
- 9 SHANNO, D.F. Quadratm termination of coniugate gradient methods. In Extrenal Methods and Systems Analys~s, A.V. Fiacco and K.O. Kortanek, Eds, Sprmger-Verlag, New York, 1980, pp. 4 33-441.Google Scholar
- 10 SHANSO, D.F., ASD PHUA, K.H. Matrix conditiomng and nonlinear optimization. Math. Program 14 (1978), 149-160.Google Scholar
- 11 SHANSO, D.F., AND PHUA, K.H. Algorithm 500. Minimization of unconstrained multivariate functions. ACM Trans. Math. Softw. 2, 1 (1976), 87-94. Google Scholar
- 12 TOlNT, Pa.L. Some numerical results using a sparse matrix updating formula in unconstrained optimization. Math. Comput. 32 (1978), 839-852.Google Scholar
Index Terms
- Remark on “Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]”
Recommendations
Iterative reweighted minimization methods for $$l_p$$lp regularized unconstrained nonlinear programming
In this paper we study general $$l_p$$ l p regularized unconstrained minimization problems. In particular, we derive lower bounds for nonzero entries of the first- and second-order stationary points and hence also of local minimizers of the $$l_p$$ l p minimization problems. ...
Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
In this paper, we first study $\ell_q$ minimization and its associated iterative reweighted algorithm for recovering sparse vectors. Unlike most existing work, we focus on unconstrained $\ell_q$ minimization, for which we show a few advantages on noisy ...
An iterative algorithm for third-order tensor multi-rank minimization
Recent work by Kilmer et al. (A third-order generalization of the matrix SVD as a product of third-order tensors, Department of Computer Science, Tufts University, Medford, MA, 2008; Linear Algebra Appl 435(3):641---658, 2011; SIAM J Matrix Anal Appl 34(...
Comments