A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization

Computers and Mathematics with Applications

Volumn 58, Issue 10, 2009, Pages 2051-2059

  Wu, Ting ^a   Yang, Yingsha ^a   Sun, Linping ^a   Shao, Hu ^b  

^a NANJING UNIVERSITY   (China)

^b CHINA UNIVERSITY OF MINING AND TECHNOLOGY   (China)

Author keywords

Derivative free optimization; Iterated subspace; Pattern search

Indexed keywords

DERIVATIVE-FREE METHODS; DERIVATIVE-FREE OPTIMIZATION; FIRST DERIVATIVE; GENERAL PATTERN SEARCHES; HIGH-DIMENSIONAL PROBLEMS; ITERATED SUBSPACE; LOW-DIMENSIONAL MANIFOLDS; MINIMIZATION METHODS; NUMERICAL RESULTS; OBJECTIVE FUNCTIONS; PATTERN SEARCH; PATTERN SEARCH METHOD; TEST EXAMPLES; UNCONSTRAINED OPTIMIZATION; UNCONSTRAINED OPTIMIZATION PROBLEMS;

FUNCTION EVALUATION; IMAGE REGISTRATION; LEARNING ALGORITHMS; OPTIMIZATION;

HEURISTIC METHODS;

EID: 70349998691     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2009.07.067     Document Type: Article

References (27)

1. Dennis J.E., and Torczon V. Direct search methods on parallel machines. SIAM Journal on Optimization 1 (1991) 448-474
2. Torczon V. On the convergence of pattern search algorithms. SIAM Journal on Optimization 7 (1997) 1-25
3. Coope I.D., and Price C.J. On the convergence of grid-based methods for unconstrained minimization. SIAM Journal on Optimization 11 (2001) 859-869
4. Wu T., and Sun L.P. A filter-based pattern search method for unconstrained optimization. Numerical Mathematics A Journal of Chinese Universities 15 3 (2006) 209-216
5. Wu T. Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm. Applied Mathematics and Computation 203 (2008) 380-386
6. R.M. Lewis, V. Torczon, Rank ordering and positive bases in pattern search algotithms, Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, VA 23681-0001, 1996
7. Davis C. Theory of positive linear dependence. American Journal of Mathematics 76 (1954) 733-746
8. Cragg E.E., and Levy A.V. Study on a supermemory gradient method for the minimization of functions. Journal of Optimization Theory and Applications and Applications 4 3 (1969) 191-205
9. Dennis J.E., and Turner K. Generalized conjugate directions. Linear Algebra and Applications 88/89 (1987) 187-209
10. Dixon L.C.W., Patel K.D., and Ducksbury P.G. Experience running optimization algorithms on parallel processing system. In 11th IFIP Conference on System Modelling and Optimization. Lecture Notes in Control and Information Sciences vol. 59 (1984), Springer Verlag, Berlin 891-932
11. Miele A., and Cantrell J.W. Study on a memory gradient method for the minimization of functions. Journal of Optimization Theory and Applications and Applications 3 (1969) 459-470
12. P.K.W. Vinsome, Orthomin, an iterative method for solving sparse sets of simultaneous linear equations, in: Proceedings of the Fourth Symposium on Reservoir Simulation. Society of Petroleum Engineers of AIME, 1976
13. Y. Saad, Krylov subspace methods: Theory, algorithms and applications, in: Computational Methods in Applied Science and Engineering, INRIA 29 January-2 February. INRIA, 1990
14. Wu T., and Sun L.P. A quasi-Newton based pattern search algorithm for unconstrained optimization. Applied Mathematics and Computation 183 (2006) 685-694
15. Conn A.R., Gould N.I.M., Sartenaer A., and Toint Ph.L. On iterated-Subspace minimization methods for nonlinear optimization. In: Adams L., and Nazareth L. (Eds). AMS-IMS-SIAM (1996) 50-78
16. Lucidi S., Sciandrone M., and Tseng P. Objective-derivative-free methods for constrained optimization. Mathematical Programming 92 1 (2002) 37-59
17. Coope I.D., and Price C.J. Frame based methods for unconstrained optimization. Journal of Optimization Theory and Applications 107 (2000) 261-274
18. Coope I.D. A conjugate direction implementation of the BFGS algorithm with automatic scaling. Journal of the Australian Mathematical Society, Series B 31 1 (1989) 122-134
19. Price C.J., and Coope I.D. Frames and grids in unconstrained and linearly constrained optimization: a nonsmooth approach. SIAM Journal on Optimization 14 2 (2003) 415-438
20. More J.J., Garbow B.S., and Hillstrom K.E. Testing unconstrained optimization software. ACM Transaction on Mathematical Software 7 (1981) 17-41
21. Schittkowski K. More test examples for nonlinear programming codes. Lecture Notes in Economics and Mathematical Systems 282 (1987), Springer-Verlag
22. Wolfe M.A., and Viazminsky C. Supermemory descent methods for unconstrained minimization. Journal of Optimization Theory and Applications and Applications 18 (1976) 455-469
23. Shanno D.F. Conjugate gradient methods with inexact searches. Mathematics of Computation 34 (1978) 499-514
24. P.E. Gill, W. Murray, Nonlinear least squares and nonlinearly constrained optimization, in: G.A. Watsom (Ed.), Numerical Analysis (Dundee, 1975), 1976, pp. 135-147
25. K.M. Brown, J.E. Dennis, New computational algorithms for minimizing a sum of squares of nonlinear function, Rep. No. 71-6, Dep. Comput Science, Yale University, New Haven, Conn., 1971
26. Box M.J. A comparison of several current optimization methods and the use of transformations in constrained problems. Computer Journal 9 (1966) 67-77
27. Sun L.P. A quasi-Newton algorithm without calculating derivatives for unconstrained optimization. Journal of Computational Mathematics 12 (1994) 380-386