Abstract
Paper deals with the non-uniform covering method that is aimed at deterministic global optimization. This method finds a feasible solution to the optimization problem numerically and proves that the obtained solution differs from the optimal by no more than a given accuracy. Numerical proof consists of constructing a set of covering sets - the coverage. The number of elements in the coverage can be very large and even exceed the total amount of available computer resources. Basic method of coverage construction is the comparison of upper and lower bounds on the value of the objective function. In this work we propose to use necessary optimality conditions of first and second order for reducing the search for boxconstrained problems. We provide the algorithm description and prove its correctness. The efficiency of the proposed approach is studied on test problems.
References
[1] Pardalos P., Romeijn E., Tuy H., Recent developments and trends in global optimization, J. of Computational and Applied Mathematics, 2000, 124 (1-2), 209-22810.1016/S0377-0427(00)00425-8Search in Google Scholar
[2] Pardalos P.M., Resende M., (Eds), Handbook of Applied Optimization, Oxford University Press, 2002Search in Google Scholar
[3] Scholz D., Deterministic global optimization: geometric branchand- bound methods and their applications, Springer Science & Business Media, 2011.10.1007/978-1-4614-1951-8_2Search in Google Scholar
[4] Nesterov Y., Introductory Lectures on Convex Optimization: A Basic Course (Applied Optimization), Springer Netherlands, 200310.1007/978-1-4419-8853-9Search in Google Scholar
[5] Kearfott R.B., Rigorous Global Search: Continuous Problems, Kluwer, Dordrecht, 199610.1007/978-1-4757-2495-0Search in Google Scholar
[6] Hansen E., Global Optimization Using Interval Analysis, Dekker, New York, 1992Search in Google Scholar
[7] Tawarmalani M., Sahinidis N.V., Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications, Kluwer, Dordrecht, 200210.1007/978-1-4757-3532-1Search in Google Scholar
[8] Strongin R.G., Sergeyev Ya.D., Global optimization with nonconvex constraints: Sequential and parallel algorithms, Kluwer Academic Publishers, Dordrecht, 200010.1007/978-1-4615-4677-1Search in Google Scholar
[9] Pinter J.D., Global Optimization in Action, Kluwer, Dordrecht, 199610.1007/978-1-4757-2502-5Search in Google Scholar
[10] Molinaro A., Pizzuti C., Sergeyev Ya.D., Acceleration tools for diagonal information global optimization algorithms, Computational Optimization and Applications, 2001, 18(1), 5-2610.1023/A:1008719926680Search in Google Scholar
[11] Lera D., Sergeyev Ya.D., Acceleration of univariate global optimization algorithms working with Lipschitz functions and Lipschitz first derivatives, SIAM Journal on Optimization, 2013, 23(1), 508-52910.1137/110859129Search in Google Scholar
[12] Kvasov D.E., Sergeyev Ya.D., Lipschitz gradients for global optimization in a one-point-based partitioning scheme, Journal of Computational and AppliedMathematics, 2012, 236(16), 4042-405410.1016/j.cam.2012.02.020Search in Google Scholar
[13] Evtushenko Yu., Numerical methods for finding global extreme (case of a non-uniform mesh), U.S.S.R. Comput. Maths. Math. Phys., Moscow, 1971, 11 (6), 38-5410.1016/0041-5553(71)90065-6Search in Google Scholar
[14] Evtushenko Yu., Potapov M., Deterministic global optimization, In Spedicato, E. (eds.) Algorithms for Continuous Optimization. The State of the Art, Kluwer, 1987, 481-50010.1007/978-94-009-0369-2_17Search in Google Scholar
[15] Evtushenko Y., Posypkin M., A deterministic approach to global box-constrained optimization, Optimization Letters, 2013, 7 (4), 819-82910.1007/s11590-012-0452-1Search in Google Scholar
[16] Evtushenko Y.G., Posypkin M.A., A deterministic algorithm for global multi-objective optimization, Optimization Methods and Software, 2014, 29 (5), 1005-101910.1080/10556788.2013.854357Search in Google Scholar
[17] Posypkin M.A., Non-uniform covering method library. https://github.com/mposypkin/NUC (viewed April 15, 2016)Search in Google Scholar
[18] Jamil M., Yang X.S., A literature survey of benchmark functions for global optimisation problems, International Journal ofMathematical Modelling and Numerical Optimisation, 2013, 4. (2), 150-19410.1504/IJMMNO.2013.055204Search in Google Scholar
[19] Evtushenko Y.G., Malkova V.U., Stanevichyus A.A., Parallel global optimization of functions of several variables, Computational Mathematics and Mathematical Physics, 2009, 49 (2), 246-26010.1134/S0965542509020055Search in Google Scholar
[20] Evtushenko Y., Posypkin M., Sigal I., A framework for parallel large-scale global optimization, Computer Science-Research and Development, 2009, 23(3-4), 211-21510.1007/s00450-009-0083-7Search in Google Scholar
© 2016
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.