Criteria for Unconstrained Global Optimization

被引:0
|
作者
E. Demidenko
机构
[1] Dartmouth College,Departments of Biostatistics and Mathematics
关键词
Existence; Nonconvex optimization; Minimization; Least squares; Maximum likelihood;
D O I
暂无
中图分类号
学科分类号
摘要
We develop criteria for the existence and uniqueness of the global minima of a continuous bounded function on a noncompact set. Special attention is given to the problem of parameter estimation via minimization of the sum of squares in nonlinear regression and maximum likelihood. Definitions of local convexity and unimodality are given using the level set. A fundamental theorem of nonconvex optimization is formulated: If a function approaches the minimal limiting value at the boundary of the optimization domain from below and its Hessian matrix is positive definite at the point where the gradient vanishes, then the function has a unique minimum. It is shown that the local convexity level of the sum of squares is equal to the minimal squared radius of the regression curvature. A new multimodal function is introduced, the decomposition function, which can be represented as the composition of a convex function and a nonlinear function from the argument space to a space of larger dimension. Several general global criteria based on majorization and minorization functions are formulated.
引用
收藏
页码:375 / 395
页数:20
相关论文
共 50 条
  • [31] A new integral filter algorithm for unconstrained global optimization
    Yue, Lina
    Yang, Yongjian
    NUMERICAL ALGORITHMS, 2013, 63 (03) : 419 - 430
  • [32] A new filled function method with unconstrained global optimization
    Yang, Xiaolin
    Zhou, Bin
    Feng, Jun
    2017 13TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2017, : 512 - 515
  • [33] A new filled function method for unconstrained global optimization
    Yang, YJ
    Shang, YL
    APPLIED MATHEMATICS AND COMPUTATION, 2006, 173 (01) : 501 - 512
  • [34] Global convergence of a memory gradient method for unconstrained optimization
    Narushima, Yasushi
    Yabe, Hiroshi
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2006, 35 (03) : 325 - 346
  • [35] A new filled function method for unconstrained global optimization
    Wang, Chengjun
    Yang, Yongjian
    Li, Jing
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2009, 225 (01) : 68 - 79
  • [36] ON THE GLOBAL CONVERGENCE OF A CURVILINEAR SEARCH METHOD FOR UNCONSTRAINED OPTIMIZATION
    MARTINEZ, JM
    MATEMATICA APLICADA E COMPUTACIONAL, 1992, 11 (03): : 227 - 236
  • [37] A Filled Function with two Parameters for unconstrained Global Optimization
    Jiao Shuqing
    PROCEEDINGS OF THE 2012 EIGHTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS 2012), 2012, : 40 - 43
  • [38] A Bumble Bees Mating Optimization Algorithm for Global Unconstrained Optimization Problems
    Marinakis, Yannis
    Marinaki, Magdalene
    Matsatsinis, Nikolaos
    NICSO 2010: NATURE INSPIRED COOPERATIVE STRATEGIES FOR OPTIMIZATION, 2010, 284 : 305 - +
  • [39] A Filled Function with Adjustable Parameters for Unconstrained Global Optimization
    SHANG You-lin
    Department of Mathematics
    数学季刊, 2004, (03) : 232 - 239
  • [40] A parameter free filled function for unconstrained global optimization
    Ma, Suzhen
    Yang, Yongjian
    Liu, Huaqun
    APPLIED MATHEMATICS AND COMPUTATION, 2010, 215 (10) : 3610 - 3619