Global minimization of increasing positively homogeneous functions over the unit simplex

被引:36
作者
Bagirov, AM [1 ]
Rubinov, AM [1 ]
机构
[1] Univ Ballarat, Sch Informat Technol & Math Sci, Ballarat, Vic 3353, Australia
关键词
global optimization; cutting angle method; increasing positively homogeneous function;
D O I
10.1023/A:1019204407420
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper we study a method for global optimization of increasing positively homogeneous functions over the unit simplex, which is a version of the cutting angle method. Some properties of the auxiliary subproblem are studied and a special algorithm for its solution is proposed. A cutting angle method based on this algorithm allows one to find an approximate solution of some problems of global optimization with 50 variables. Results of numerical experiments are discussed.
引用
收藏
页码:171 / 187
页数:17
相关论文
共 8 条
[1]   Cutting angle methods in global optimization [J].
Andramonov, M ;
Rubinov, A ;
Glover, B .
APPLIED MATHEMATICS LETTERS, 1999, 12 (03) :95-100
[2]  
ANDRAMONOV MY, 1997, 977 SITMS U BALL
[3]   CONTINUOUS-SELECTIONS OF LINEAR FUNCTIONS AND NONSMOOTH CRITICAL-POINT THEORY [J].
BARTELS, SG ;
KUNTZ, L ;
SCHOLTES, S .
NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 1995, 24 (03) :385-407
[4]  
Demyanov VF., 1995, CONSTRUCTIVE NONSMOO
[5]  
Du DingZhu., 1995, MINIMAX APPL, DOI 10.1007/978-1-4613-3557-3
[6]  
PALLACHKE D, 1997, FDN MATH OPTIMIZATIO
[7]   Lipschitz programming via increasing convex-along-rays functions [J].
Rubinov, A ;
Andramonov, V .
OPTIMIZATION METHODS & SOFTWARE, 1999, 10 (06) :763-781
[8]   Minimizing increasing star-shaped functions based on abstract convexity [J].
Rubinov, AM ;
Andramonov, MY .
JOURNAL OF GLOBAL OPTIMIZATION, 1999, 15 (01) :19-39