MAPLE code for the gamma algorithm for global optimization of uncertain functions in economy and finance

被引:1
|
作者
Delgado Pineda, M. [2 ]
Galperin, E. A. [1 ]
机构
[1] Univ Quebec, Dept Math, Montreal, PQ H3C 3P8, Canada
[2] Univ Educ Distancia, Dept Matemat Fundamentales, Fac Ciencias, Madrid 28040, Spain
关键词
Global optimization of uncertain functions; Gamma algorithm; Cubic algorithm;
D O I
10.1016/j.camwa.2010.02.013
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Problems with uncertainties are ubiquitous in many areas of life and the economy. Due to a lack of information as regards the economy and in finance, problems with uncertainties (stock prices, marketing problems, inflation, unemployment) are usually formulated by giving bounds on maximum and minimum values of certain parameters, i.e. box constraints. In such situations, iris necessary to make a choice of better parameters that produce finite intervals of possible values for a given uncertain function at each point of the parameter space. The gamma algorithm presents a method for making that choice. A variant of the gamma algorithm based on the cubic algorithm is considered, for global optimization of uncertain functions with box constraints in R-n. The set-monotonic algorithm contains a block for problems with equality constraints, and operates within the unit cube [0, 1](n) for all problems. On this basis, a MAPLE code of modular structure is developed for full global optimization of uncertain functions in n variables. The code does not create ill-conditioned situations. Graphics are included, and the solution set can be visualized in plane projections and sections. An example related to Minsky's Financial Instability Hypothesis is presented, with a graph, to illustrate the use of the code. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码:2951 / 2963
页数:13
相关论文
共 50 条
  • [41] An improved univariate global optimization algorithm with improved linear lower bounding functions
    Wang, XJ
    Chang, TS
    JOURNAL OF GLOBAL OPTIMIZATION, 1996, 8 (04) : 393 - 411
  • [42] Novel Algorithm for Linearly Constrained Derivative Free Global Optimization of Lipschitz Functions
    Stripinis, Linas
    Paulavicius, Remigijus
    MATHEMATICS, 2023, 11 (13)
  • [43] Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions
    Kang, Fei
    Li, Junjie
    Ma, Zhenyue
    INFORMATION SCIENCES, 2011, 181 (16) : 3508 - 3531
  • [44] A Two-Phase Global Optimization Algorithm for Black-Box Functions
    Gimbutiene, Grazina
    Zilinskas, Antanas
    BALTIC JOURNAL OF MODERN COMPUTING, 2015, 3 (03): : 214 - 224
  • [45] Algorithm 829: Software for generation of classes of test functions with known local and global minima for global optimization
    Gaviano, M
    Kvasov, DE
    Lera, D
    Sergeyev, YD
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2003, 29 (04): : 469 - 480
  • [46] Intelligent optimization algorithm for global convergence of non-convex functions based on improved fuzzy algorithm
    Qiao, Junfeng
    Niu, Yujun
    Kifer, T.
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2018, 35 (04) : 4465 - 4473
  • [47] An universal tabu search algorithm for global optimization of multimodal functions with continuous variables in electromagnetics
    Yang, SY
    Ni, GZ
    Li, Y
    Tian, BX
    Li, RL
    IEEE TRANSACTIONS ON MAGNETICS, 1998, 34 (05) : 2901 - 2904
  • [48] Global Optimization of Some Difficult Benchmark Functions by Host-Parasite Coevolutionary Algorithm
    Mishra, Sudhanshu K.
    ECONOMICS BULLETIN, 2013, 33 (01): : 1 - 18
  • [49] Efficient Multi-Objective Evolutionary Algorithm for Constrained Global Optimization of Expensive Functions
    Han, Zhonghua
    Liu, Fei
    Xu, Chenzhou
    Zhang, Keshi
    Zhang, Qingfu
    2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2019, : 2026 - 2033
  • [50] A hybrid ant colony algorithm for global optimization of continuous multi-extreme functions
    Ge, Y
    Meng, QC
    Yan, CJ
    Xu, J
    PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 2427 - 2432