1. Regularized Newton Methods for Convex Minimization Problems with Singular Solutions
   Li, D. H.; Fukushima, M.; Qi, L.; Yamashita, N.
   Computational Optimization and Applications., 2004, vol. 28, no. 2, pp. 131-147, Ingenta.  
2. Convergence of Newton's Method for a Minimization Problem in Impulse Noise Removal
   Chan, Raymond H.; Ho, Chung-wa; Nikolova, Mila
   Special issue dedicated to the 70th birthday of Professor Zhong-Ci Shi.  Journal of Computational Mathematics, 2004, vol. 22, no. 2, pp. 168-177, MathSciNet.  
3. An Inexact Newton-CG-Type Active Contour Approach for the Minimization of the Mumford-Shah Functional
   Hintermuller, Michael; Ring, Wolfgang
   Journal of Mathematical Imaging and Vision, v 20, n 1-2, January/March, 2004, p 19-42, Compendex.
4. A Quasi-Newton Penalty Barrier Method for Convex Minimization Problems
   Armand, Paul  
   Computational Optimization and Applications, v 26, n 1, October, 2003, p 5-34, Compendex.
5. Matrix algebras in quasi-Newton methods for unconstrained minimization.
   Di Fiore, Carmine; Fanelli, Stefano; Lepore, Filomena; Zellini, Paolo
   Numerische Mathematik, 2003, vol. 94, no. 3, pp. 479-500, MathSciNet.   
6. A Truncated Newton Method for the Solution of Large-Scale Inequality Constrained Minimization Problems
   Facchinei, F.; Liuzzi, G.; Lucidi, S.
   Computational Optimization and Applications, 2003, vol. 25, no. 1/3, pp. 85-122, Ingenta.  
7. Principal component analysis combined with truncated-Newton minimization for dimensionality reduction of chemical databases
   Xie, D.; Singh, S. B.; Fluder, E. M.; Schlick, T.
   Mathematical Programming, 2003, vol. 95, no. 1, pp. 161-185, Ingenta.  
8. Newton's problem of the body of minimal aerodynamic resistance
   Plakhov, A.Yu.
   Doklady Akademii Nauk, v 390, n 3, 2003, p 314-318, Compendex.
9. The Newton Bracketing Method for Convex Minimization
   Levin, Y.; Ben-Israel, A.
   Computational Optimization and Applications, 2002, vol. 21, no. 2, pp. 213-229, Ingenta.  
10. Solving a quadratric matrix equation by Newton's method with exact line searches.    
    Higham, Nicholas J.; Kim, Hyun-Min    
    SIAM J. Matrix Anal. Appl. 23 (2001), no. 2, 303--316 (electronic), MathSciNet.  
11. A scaled Gauss-Newton primal-dual search direction for semidefinite optimization.    
    de Klerk, E.; Peng, J.; Roos, C.; Terlaky, T.    
    SIAM J. Optim. 11 (2001), no. 4, 870--888 (electronic), MathSciNet.  
12. Remarks on large-scale matrix diagonalization using a Lagrange-Newton-Raphson minimization in a subspace.
    Anglada, J.M.; Besalu, E.; Bofill, J.M.
    Theoretical Chemistry Accounts, 2000, vol. 103, no. 2, pp. 163, Ingenta.  
13. Quasi-Newton quadratic penalty method for minimization subject to nonlinear equality constraints
    Coleman, Thomas F. ; Liu, Jianguo; Yuan, Wei
    Computational Optimization and Applications, v 15, n 2, 2000, p 103-123, Compendex.  
14. An Efficient Projection Protocol for Chemical Databases: Singular Value Decomposition Combined with Truncated-Newton Minimization
    Xie, Dexuan; Tropsha, Alexander; Schlick, Tamar
    Journal of Chemical Information and Computer Sciences, v 40, n 1, January/February, 2000, p 167-177, Compendex.  
15. A bundle-Newton method for nonsmooth unconstrained minimization.
    Luksan, Ladislav; Vlcek, Jan
    Mathematical programming, 1998, vol. 83, no. 3, pp. 373-391, Ingenta.  
16. A Dynamical System Associated with Newton's Method for Parametric Approximations of Convex Minimization Problems.
    Alvarez D., F.; Perez C., J.M.
    Applied mathematics and optimization, 1998, vol. 38, no. 2, pp. 193-217, Ingenta.  
17. A Subspace Limited Memory Quasi-Newton Algorithm for Large-Scale Nonlinear Bound Constrained Optimization  
    Q. Ni; Y. Yuan  
    Mathematics of Computation, Vol. 66, No. 220. (Oct., 1997), pp. 1509-1520, Jstor.  
18. Newton Methods for Large-Scale Linear Inequality-Constrained Minimization.
    Forsgren, Anders; Murray, Walter
    SIAM journal on optimization, 1997, vol. 7, no. 1, pp. 162-176, Ingenta.  
19. A controlled random search algorithm with local Newton-type search for global optimization.    
    Di Pillo, Gianni; Lucidi, Stefano; Palagi, Laura; Roma, Massimo    
    High performance algorithms and software in nonlinear optimization (Ischia, 1997), 143--159, Appl. Optim., 24, Kluwer Acad. Publ., Dordrecht, 1998, MathSciNet.  
20. Piecewise line-search techniques for constrained minimization by quasi-Newton algorithms.   
    Gilbert, Jean Charles    
    Advances in nonlinear programming (Beijing, 1996), 73--103, Appl. Optim., 14, Kluwer Acad. Publ., Dordrecht, 1998, MathSciNet.  
21. An improved line search technique in quasi-Newton methods for systems of nonlinear equations. (Chinese)    
    Li, Dong Hui; Zhang, Zhong Zhi    
    Hunan Daxue Xuebao 23 (1996), no. 4, 1--6, MathSciNet.  
22. A Globally Convergent Newton Method for Convex DC1 Minimization Problems.
    Pang, J. S.; Qi, L.
    Journal of optimization theory and applications, 1995, vol. 85, no. 3, pp. 633, Ingenta.  
23. The Newton and Cauchy Perspectives on Computational Nonlinear Optimization  
    J. L. Nazareth  
    SIAM Review, Vol. 36, No. 2. (Jun., 1994), pp. 215-225, Jstor.  
24. On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds.
    Coleman, Thomas F.; Li, Yuying
    Mathematical programming, 1994, vol. 67, no. 2, pp. 189-224, Ingenta.  
25. Local properties of a Newton-like direction for equality constrained minimization problems
    Facchinei, Francisco (Universita di Parma); Lucidi, Stefano   
    Optimization Methods and Software, v 3, n 1-3, 1994, p 13-26,  Compendex.  
26. A nonmonotone line search technique for improved projected quasi-Newton methods.    
    Zhu, De Tong    
    Optimization 28 (1993), no. 1, 31--45, MathSciNet.  
27. Newton methods for large-scale linear equality-constrained minimization.
    Forsgren, A.; Murray, W.
    SIAM J. Matrix Anal. Appl. 14 (1993), no. 2, 560--587, MathSciNet.  
28. Gauss-Seidel-Newton-Armijo approach for minimization problems on the non-negative orthant: Application to spatial price equilibrium problems.
    Crouzeix, J.-P.; Ferland, J.A.; Zubieta, L.
    European journal of operational research, 1992, vol. 57, no. 3, pp. 395, Ingenta.  
29. Grouped Coordinate Minimization Using Newton's Method for Inexact Minimization in One vector Coordinate.
    Hathaway, R. J.; Bezdek, J. C.
    Journal of optimization theory and applications, 1991, vol. 71, no. 3, pp. 503-516, Ingenta.  
30. Phase noise characterization of SAW oscillators based on a Newton minimization procedure
    Klemer, David P.; Shih, Ko-Ming; Clark, Earl E. III
    IEEE Transactions on Microwave Theory and Techniques, v 39, n 5, May, 1991, p 883-889, Compendex.
31. Conjugate gradient methods using quasi-Newton updates with inexact line searches.   
    Sherali, Hanif D.; Ulular, Osman    
    J. Math. Anal. Appl. 150 (1990), no. 2, 359--377, MathSciNet.  
32. Assessing a search direction within a truncated-Newton method.    
    Nash, Stephen G.; Sofer, Ariela    
    Oper. Res. Lett. 9 (1990), no. 4, 219--221, MathSciNet.  
33. A versatile implementation of the Gauss-Newton minimization algorithm using MATLAB for Macintosh microcomputers.
    Rovati, G. E.
    Computer methods and programs in biomedicine, 1990, vol. 32, no. 2, pp. 161-167, Ingenta.  
34. Phase noise characterization of SAW oscillators based on a Newton minimization procedure
    Klemer, David P.; Clark, Earl E.; Shih, Ko-Ming
    IEEE MTT-S International Microwave Symposium Digest, v 3, 1990, p 1269-1272, Compendex.
35. A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization  
    Richard H. Byrd, Jorge Nocedal  
    SIAM Journal on Numerical Analysis, Vol. 26, No. 3. (Jun., 1989), pp. 727-739, Jstor.  
36. A truncated Newton method with nonmonotone line search for unconstrained optimization.    
    Grippo, L.; Lampariello, F.; Lucidi, S.    
    J. Optim. Theory Appl. 60 (1989), no. 3, 401--419, MathSciNet.  
37. A parallel quasi-Newton method for partially separable large scale minimization.
    Chen, M.-Q.; Han, S.-P.
    Ann. Oper. Res. 14 (1988), no. 1-4, 195--211, MathSciNet.  
38. A projected Newton method for minimization problems with nonlinear inequality constraints.
    Dunn, J. C.
    Numer. Math. 53 (1988), no. 4, 377--409, MathSciNet.  
39. A Convergence Theory for a Class of Quasi-Newton Methods for Constrained Optimization  
    Rodrigo Fontecilla, Trond Steihaug, Richard A. Tapia  
    SIAM Journal on Numerical Analysis, Vol. 24, No. 5. (Oct., 1987), pp. 1133-1151, Jstor.  
40. Global Convergence of a Class of Quasi-Newton Methods on Convex Problems  
    Richard H. Byrd, Jorge Nocedal, Ya-Xiang Yuan
    SIAM Journal on Numerical Analysis, Vol. 24, No. 5. (Oct., 1987), pp. 1171-1190, Jstor.  
41. On the Characterization of q-Superlinear Convergence of Quasi-Newton Methods for Constrained Optimization  
    J. Stoer, R. A. Tapia  
    Mathematics of Computation, Vol. 49, No. 180. (Oct., 1987), pp. 581-584, Jstor.  
42. Newton-type algorithms with nonmonotone line search for large-scale unconstrained optimization.    
    Grippo, L.; Lampariello, F.; Lucidi, S.    
    System modelling and optimization (Tokyo, 1987), 187--196, Lecture Notes in Control and Inform. Sci., 113, Springer, Berlin, 1988, MathSciNet.  
43. Computational results of Newton's method with search along an approximate hook step curve, for unconstrained minimization.    
    Nabona, Narcís    
    Proceedings of the first international seminar on operational research of the Basque Provinces (Zarauz, 1986), 21--54, Univ. Pais Vasco, Bilbao, 1986, MathSciNet.  
44. A nonmonotone line search technique for Newton's method.    
    Grippo, L.; Lampariello, F.; Lucidi, S.    
    SIAM J. Numer. Anal. 23 (1986), no. 4, 707--716, MathSciNet.  
45. Combined LP and Quasi-Newton Methods for Nonlinear l1 Optimization  
    Jorgen Hald; Kaj Madsen  
    SIAM Journal on Numerical Analysis, Vol. 22, No. 1. (Feb., 1985), pp. 68-80, Jstor.  
46. Newton-Type Minimization Via the Lanczos Method  
    Stephen G. Nash  
    SIAM Journal on Numerical Analysis, Vol. 21, No. 4. (Aug., 1984), pp. 770-788, Jstor.  
47. A quasi-Newton method with sparse triple factorization for unconstrained minimization.
    Chen, Dao Qi; Tewarson, R. P.
    Computing 33 (1984), no. 3-4, 315--329, MathSciNet.  
48. Generalized Newton Algorithm To Minimize A Function With Many Variables Using Computer-Evaluated Exact Higher-Order Derivatives.
    Kalaba, R.; Tishler, A.  
    Journal of Optimization Theory and Applications, v 42, n 3, Mar, 1984, p 383-395, Compendex.
49. An Explicit Quasi-Newton Update for Sparse Optimization Calculations  
    Angelo Lucia  
    Mathematics of Computation, Vol. 40, No. 161. (Jan., 1983), pp. 317-322, Jstor.  
50. Analysis of Newton's Method at Irregular Singularities  
    A. Griewank, M. R. Osborne  
    SIAM Journal on Numerical Analysis, Vol. 20, No. 4. (Aug., 1983), pp. 747-773, Jstor.  
51. Aircraft Parameter Identification By Gauss-Newton Minimization Technique Using Flight Test Data.
    Raisinghani, S. C.; Adak, A. K.
    International Journal of Systems Science, v 14, n 12, Dec, 1983, p 1395-1409, Compendex.  
52. A class of rank-one positive definite quasi-Newton updates for unconstrained minimization.  
    Spedicato, Emilio  
    Math. Operationsforsch. Statist. Ser. Optim. 14 (1983), no. 1, 61 - 70, MathSciNet.  
53. Modified Newton's Method For Minimizing Factorable Functions.
    Sisser, F. S.  
    Journal of Optimization Theory and Applications, v 38, n 4, Dec, 1982, p 461-482, Compendex.
54. A compact updating formula for quasi-Newton minimization algorithms.
    Grandinetti, L.
    J. Optim. Theory Appl. 36 (1982), no. 4, 477--494, MathSciNet.  
55. Discrete Newton Algorithm For Minimizing A Function Of Many Variables.
    O'Leary, Dianne P.
    Mathematical Programming, v 23, n 1, May, 1982, p 20-33, Compendex.
56. Quasi-Newton Methods Without Projections For Unconstrained Minimization.
    Luksan, Ladislav  
    Kybernetika, v 18, n 4, 1982, p 290-306, Compendex.
57. On a Newton-like method for constrained nonlinear minimization via slack variables.
    Spedicato, E.
    Journal of Optimization Theory and Applications, v 36, n 2, Feb, 1982, p 175-190, MathSciNet.  
58. Newton's method and the Goldstein step-length rule for constrained minimization problems.
    Dunn, J. C.
    SIAM J. Control Optim. 18 (1980), no. 6, 659--674, MathSciNet.  
59. A Modified Newton's Method for Unconstrained Minimization  
    Shmuel Kaniel, Achiya Dax  
    SIAM Journal on Numerical Analysis, Vol. 16, No. 2. (Apr., 1979), pp. 324-331, Jstor.  
60. Least Change Secant Updates for Quasi-Newton Methods  
    J. E. Dennis, Jr.; R. B. Schnabel  
    SIAM Review, Vol. 21, No. 4. (Oct., 1979), pp. 443-459, Jstor.  
61. A Newton-type curvilinear search method for constrained optimization.    
    Botsaris, C. A. E.    
    J. Math. Anal. Appl. 69 (1979), no. 2, 372--397, MathSciNet.  
62. Minimum Norm Symmetric Quasi-Newton Updates Restricted to Subspaces  
    Robert B. Schnabel  
    Mathematics of Computation, Vol. 32, No. 143. (Jul., 1978), pp. 829-837, Jstor.  
63. Revision of a Derivative-Free Quasi-Newton Method  
    John Greenstadt  
    Mathematics of Computation, Vol. 32, No. 141. (Jan., 1978), pp. 201-221, Jstor.  
64. A combined conjugate-gradient quasi-Newton minimization algorithm.
    Buckley, A. G.
    Mathematical Programming, v 15, n 2, Sep, 1978, p 200-210, Compendex.  
65. A note on the determination of the scaling parameters in a class of quasi-Newton methods for unconstrained minimization.  
    Spedicato, E.  
    J. Inst. Math. Appl. 21 (1978), no. 3, 285--291, MathSciNet.  
66. Quasi-Newton Methods, Motivation and Theory  
    J. E. Dennis, Jr.; Jorge J. More  
    SIAM Review, Vol. 19, No. 1. (Jan., 1977), pp. 46-89, Jstor.  
67. A modified Newton method for minimization.
    Fletcher, R.; Freeman, T. L.
    J. Optimization Theory Appl. 23 (1977), no. 3, 357--372, MathSciNet.  
68. A Newton-type curvilinear search method for optimization.    
    Botsaris, C. A.; Jacobson, D. H.    
    J. Math. Anal. Appl. 54 (1976), no. 1, 217--229, MathSciNet.  
69. A quasi-Newton method with memory for unconstrained function minimization.
    Wolfe, M. A.
    J. Inst. Math. Appl. 15 (1975), 85--94, MathSciNet.  
70. A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods  
    J. E. Dennis, Jr.; Jorge J. More  
    Mathematics of Computation, Vol. 28, No. 126. (Apr., 1974), pp. 549-560, Jstor.  
71. Newton's Method for Optimization Problems with Equality Constraints  
    R. A. Tapia  
    SIAM Journal on Numerical Analysis, Vol. 11, No. 5. (Oct., 1974), pp. 874-886, Jstor.  
72. A pseudo Newton-Raphson method for function minimization.
    Mamen, R.; Mayne, D. Q.
    Journal of Optimization Theory and Applications, v 10, n 5, Nov, 1972, p 263-276, MathSciNet.  
73. Parameter Selection for Modified Newton Methods for Function Minimization  
    D. F. Shanno  
    SIAM Journal on Numerical Analysis, Vol. 7, No. 3. (Sep., 1970), pp. 366-372, Jstor.  
74. Conditioning of Quasi-Newton Methods for Function Minimization  
    D. F. Shanno  
    Mathematics of Computation, Vol. 24, No. 111. (Jul., 1970), pp. 647-656, Jstor.  
75. Optimal Conditioning of Quasi-Newton Methods  
    D. F. Shanno, P. C. Kettler  
    Mathematics of Computation, Vol. 24, No. 111. (Jul., 1970), pp. 657-664, Jstor.  
76. The Convergence of Single-Rank Quasi-Newton Methods  
    C. G. Broyden  
    Mathematics of Computation, Vol. 24, No. 110. (Apr., 1970), pp. 365-382, Jstor.  
77. Conditioning of quasi-Newton methods for function minimization.
    Shanno, D. F.
    Math. Comp. 24 1970 647--656, MathSciNet.  
78. Quasi-Newton Methods and their Application to Function Minimisation  
    C. G. Broyden  
    Mathematics of Computation, Vol. 21, No. 99. (Jul., 1967), pp. 368-381, Jstor.  

(c) John H. Mathews 2004