论文信息 - MODIFIED VERSIONS OF THE CUTTING ANGLE METHOD

MODIFIED VERSIONS OF THE CUTTING ANGLE METHOD

The cutting angle method for solving global optimization problems has recently been developed. We propose some modifications and improvements of this method and report results of numerical experiments which demonstrate that the cutting angle method becomes a powerful tool for solving many problems of global optimization.

A. M. Rubinov | A. M. Bagirov

[1] Yu. G. Evtushenko. A numerical method for finding best guaranteed estimates , 1972 .

[2] Diethard Pallaschke,et al. Foundations of mathematical optimization : convex analysis without linearity , 1997 .

[3] B. M. Glover,et al. Cutting angle methods in global optimization , 1999 .

[4] Alexander Rubinov,et al. Lipschitz programming via increasing convex-along-rays functions * , 1999 .

[5] Adil M. Bagirov,et al. Global Minimization of Increasing Positively Homogeneous Functions over the Unit Simplex , 2000, Ann. Oper. Res..

[6] Adil M. Bagirov. Minimization Methods for One Class of Nonsmooth Functions and Calculation of Semi-Equilibrium Prices , 1999 .

[7] A. Rubinov. Abstract Convexity and Global Optimization , 2000 .

[8] Diethard Pallaschke,et al. Foundations of Mathematical Optimization , 1997 .

[9] Alexander M. Rubinov,et al. Minimizing Increasing Star-shaped Functions Based on Abstract Convexity , 1999, J. Glob. Optim..