Abstract
In this paper, we introduce the weighted composite search directions to develop the quadratic approximation methods. The purpose is to make fully use of the information disclosed by the former steps to construct possibly more promising directions. Firstly, we obtain these composite directions based on the properties of simplex methods and use them to construct trust region subproblems. Then, these subproblems are solved in the algorithm to find solutions of some benchmark optimization problems. The computation results show that for most tested problems, the improved quadratic approximation methods can obviously reduce the number of function evaluations compared with the existing ones. Finally, we conclude that the algorithm will perform better if the composite directions approach the previous steepest descent direction of the sub-simplex so far. We also point out the potential applications of this improved quadratic interpolation method in business intelligence systems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Garcia-Palomares U.M., Gonzalez-Castaño F.J., Burguillo-Rial J.C.: A combined global & local search approach to global optimization. J. Glob. Optim. 34, 409–426 (2006)
Vaz A.I.F., Vicente L.N.: A particle swarm pattern search method for bound constrained global optimization. J. Glob. Optim. 39, 197–219 (2007)
Pardalos, P.M., Resende, M. (eds): Handbook of Applied Optimization. Oxford University Press, Oxford (2002)
Winfield, D.: Function and functional optimization by interpolation in data tables. Ph.D Thesis, Hardvard University, Cambridge, USA (1969)
Winfield D.: Function minimization by interpolation in a data table. J. Inst. Math. Appl. 12, 339–347 (1973)
Powell M.J.D.: A new algorithm for unconstrained optimization. In: Rosen, J.B., Mangasarian, O.L., Ritter, K. (eds) Nonlinear Programming, Academic Press, New York (1970)
Yuan Y.X.: Conditions for convergence of trust region algorithms for nonsmooth optimization. Math. Program. 31, 220–228 (1985)
Yuan Y.X.: On the superlinear convergence of a trust region algorithm fornonsmooth optimization. Math. Program. 31, 269–285 (1985)
Du J.Z., Pardalos P.M., Wu W.L.: Mathematical Theory of Optimization. Kluwer, Dordrecht (2001)
Lucia A., Dimaggio P.A., Depa P.: A geometric terrain methodology for global optimization. J. Glob. Optim. 29, 297–314 (2004)
Powell M.J.D.: UOBYQA: unconstrained optimization by quadratic approximation. Math. Program. 92, 555–582 (2002)
Powell M.J.D.: On the use of quadratic models in unconstrained minimization without derivatives. Optim. Methods Softw. 19, 399–411 (2004)
Han L.X., Liu G.H.: On the convergence of the UOBYQA method. J. Appl. Math. Comput. 16(1–2), 125–142 (2004)
Berghen F.V., Bersini H.: CONDOR, a new parallel, constrained extension of Powell’s UOBYQA algorithm: experimental results and comparison with the DFO algorithm. J. Comput. Appl. Math. 181(1), 157–175 (2005)
Zhou Q.H.: On the use of simplex methods in constructing quadratic models. Sci. China Ser. A Math. 50(7), 913–924 (2007)
Torczon, V.: Multi-directional search: a direct search algorithm for parallel machines. Ph.D Thesis, Rice University, Houston, TX, USA (1989)
Moré J.J., Garbow B.S., Hillstorm K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 17–41 (1981)
Moré J.J., Sorensen D.C.: Computing a trust region step. SIAM J. Sci. Stat. Comput. 4, 553–572 (1983)
Parlett B.N.: The Symmetric Eigenvalue Problem. Prentice-Hall, Englewood Cliffs (1980)
Vercellis C.: Business Intelligence. Wiley, New York (2009)
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Zhou, Q., Li, Y. & Ha, M. Constructing composite search directions with parameters in quadratic interpolation models. J Glob Optim 51, 313–324 (2011). https://doi.org/10.1007/s10898-010-9600-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-010-9600-2