American Institute of Mathematical Sciences

Advanced
  • Previous Article
    Optimality conditions, duality and saddle points for nondifferentiable multiobjective fractional programs
  • JIMO Home
  • This Issue
  • Next Article
    A nonsmooth Newton's method for discretized optimal control problems with state and control constraints
April  2008, 4(2): 271-285. doi: 10.3934/jimo.2008.4.271

New approach to global minimization of normal multivariate polynomial based on tensor

Zhong Wan 1, and  Chunhua Yang 2,

1. 

School of Mathematics Sciences and Computing Technology, Central South University, Hunan Changsha, 410083, China
2. 

School of Information Science and Engineering, Central South University, Changsha, 410083, China

Received  January 2007 Revised  September 2007 Published  April 2008

In this paper, we first present a concise representation of multivariate polynomial, based on which we deduce the calculation formulae of its derivatives using tensor. Then, we propose a solution method to determine a global descent direction for the minimization of general normal polynomial. At a local and non-global maximizer or saddle point, we could use this method to get a global descent direction of the objective function. By using the global descent direction, we can transform an $n$-dimensional optimization problem into a one-dimensional one. Based on some efficient algorithms for one dimensional global optimization, we develop an algorithm to compute the global minimizer of normal multivariate polynomial. Numerical examples show that the proposed algorithm is promising.
Keywords: polynomial optimization, representation of polynomials, global minimization., global descent direction, tensor.
Mathematics Subject Classification: Primary: 90C22,90C26; Secondary: 49M20,49N1.
Citation: Zhong Wan, Chunhua Yang. New approach to global minimization of normal multivariate polynomial based on tensor. Journal of Industrial & Management Optimization, 2008, 4 (2) : 271-285. doi: 10.3934/jimo.2008.4.271
[1]

Zhongliang Deng, Enwen Hu. Error minimization with global optimization for difference of convex functions. Discrete & Continuous Dynamical Systems - S, 2019, 12 (4&5) : 1027-1033. doi: 10.3934/dcdss.2019070
[2]

Yingying Li, Stanley Osher. Coordinate descent optimization for l1 minimization with application to compressed sensing; a greedy algorithm. Inverse Problems & Imaging, 2009, 3 (3) : 487-503. doi: 10.3934/ipi.2009.3.487
[3]

Mengmeng Zheng, Ying Zhang, Zheng-Hai Huang. Global error bounds for the tensor complementarity problem with a P-tensor. Journal of Industrial & Management Optimization, 2019, 15 (2) : 933-946. doi: 10.3934/jimo.2018078
[4]

R. Wong, L. Zhang. Global asymptotics of Hermite polynomials via Riemann-Hilbert approach. Discrete & Continuous Dynamical Systems - B, 2007, 7 (3) : 661-682. doi: 10.3934/dcdsb.2007.7.661
[5]

Jie Huang, Xiaoping Yang, Yunmei Chen. A fast algorithm for global minimization of maximum likelihood based on ultrasound image segmentation. Inverse Problems & Imaging, 2011, 5 (3) : 645-657. doi: 10.3934/ipi.2011.5.645
[6]

Tom Goldstein, Xavier Bresson, Stan Osher. Global minimization of Markov random fields with applications to optical flow. Inverse Problems & Imaging, 2012, 6 (4) : 623-644. doi: 10.3934/ipi.2012.6.623
[7]

Gaohang Yu, Lutai Guan, Guoyin Li. Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property. Journal of Industrial & Management Optimization, 2008, 4 (3) : 565-579. doi: 10.3934/jimo.2008.4.565
[8]

Meng Ding, Ting-Zhu Huang, Xi-Le Zhao, Michael K. Ng, Tian-Hui Ma. Tensor train rank minimization with nonlocal self-similarity for tensor completion. Inverse Problems & Imaging, 2021, 15 (3) : 475-498. doi: 10.3934/ipi.2021001
[9]

Janos Kollar. Polynomials with integral coefficients, equivalent to a given polynomial. Electronic Research Announcements, 1997, 3: 17-27.

[10]

King Hann Lim, Hong Hui Tan, Hendra G. Harno. Approximate greatest descent in neural network optimization. Numerical Algebra, Control & Optimization, 2018, 8 (3) : 327-336. doi: 10.3934/naco.2018021
[11]

Jing Quan, Zhiyou Wu, Guoquan Li. Global optimality conditions for some classes of polynomial integer programming problems. Journal of Industrial & Management Optimization, 2011, 7 (1) : 67-78. doi: 10.3934/jimo.2011.7.67
[12]

Jackson Itikawa, Jaume Llibre. Global phase portraits of uniform isochronous centers with quartic homogeneous polynomial nonlinearities. Discrete & Continuous Dynamical Systems - B, 2016, 21 (1) : 121-131. doi: 10.3934/dcdsb.2016.21.121
[13]

Rentsen Enkhbat, Evgeniya A. Finkelstein, Anton S. Anikin, Alexandr Yu. Gornov. Global optimization reduction of generalized Malfatti's problem. Numerical Algebra, Control & Optimization, 2017, 7 (2) : 211-221. doi: 10.3934/naco.2017015
[14]

Enkhbat Rentsen, J. Zhou, K. L. Teo. A global optimization approach to fractional optimal control. Journal of Industrial & Management Optimization, 2016, 12 (1) : 73-82. doi: 10.3934/jimo.2016.12.73
[15]

Ahmet Sahiner, Nurullah Yilmaz, Gulden Kapusuz. A novel modeling and smoothing technique in global optimization. Journal of Industrial & Management Optimization, 2019, 15 (1) : 113-130. doi: 10.3934/jimo.2018035
[16]

Giancarlo Bigi. Componentwise versus global approaches to nonsmooth multiobjective optimization. Journal of Industrial & Management Optimization, 2005, 1 (1) : 21-32. doi: 10.3934/jimo.2005.1.21
[17]

Chien-Wen Chao, Shu-Cherng Fang, Ching-Jong Liao. A tropical cyclone-based method for global optimization. Journal of Industrial & Management Optimization, 2012, 8 (1) : 103-115. doi: 10.3934/jimo.2012.8.103
[18]

Bun Theang Ong, Masao Fukushima. Global optimization via differential evolution with automatic termination. Numerical Algebra, Control & Optimization, 2012, 2 (1) : 57-67. doi: 10.3934/naco.2012.2.57
[19]

Dmitri E. Kvasov, Yaroslav D. Sergeyev. Univariate geometric Lipschitz global optimization algorithms. Numerical Algebra, Control & Optimization, 2012, 2 (1) : 69-90. doi: 10.3934/naco.2012.2.69
[20]

Mingshang Hu. Stochastic global maximum principle for optimization with recursive utilities. Probability, Uncertainty and Quantitative Risk, 2017, 2 (0) : 1-. doi: 10.1186/s41546-017-0014-7

2020 Impact Factor: 1.801

Tools

Metrics

  • PDF downloads (53)
  • HTML views (0)
  • Cited by (2)

Other articles
by authors

[Back to Top]

Copyright © 2021 American Institute of Mathematical Sciences | Privacy Policy