Bounds on Eigenvalues of Real Symmetric Interval Matrices for αBB Method in Global Optimization
DOI:
https://doi.org/10.2298/YJOR230315019ZKeywords:
Global optimization, αBB method, eigenvalues bounds, Hessian matrix, interval matrices, interval analysisAbstract
In this paper, we investigate bounds on eigenvalues of real symmetric interval matrices. We present a method that computes bounds on eigenvalues of real symmetric interval matrices. It outperforms many methods developed in the literature and produces as sharp as possible bounds on eigenvalues of real symmetric interval matrices. The aim is to apply the proposed method to compute lower bounds on eigenvalues of a symmetric interval hessian matrix of a nonconvex function in the αBB method and use them to produce a tighter underestimator that improves the αBB algorithm for solving global optimization problems. In the end, we illustrate by example, the comparison of various approaches of bounding eigenvalues of real symmetric interval matrices. Moreover, a set of test problems found in the literature are solved efficiently and the performances of the proposed method are compared with those of other methods.References
C. D. Maranas and C. A. Floudas, “A deterministic global optimization approach for molecular structure determination,” The Journal of chemical physics, vol. 100, no. 2, pp. 1247- 1261, 1994. doi: 10.1063/1.467236
C. S. Adjiman, S. Dallwig, C. A. Floudas, and A. Neumaier, “A global optimization method, αbb, for general twice-differentiable constrained nlps-i. theoretical advances,” Computers & Chemical Engineering, vol. 22, no. 9, pp. 1137-1158, 1998. doi: 10.1016/S0098- 1354(98)00027-1
C. S. Adjiman, I. P. Androulakis, and C. A. Floudas, “A global optimization method, αbb, for general twice-differentiable constrained nlps-ii. implementation and computational results,” Computers & chemical engineering, vol. 22, no. 9, pp. 1159-1179, 1998. doi: 10.1016/S0098-1354(98)00218-X
I. P. Androulakis, C. D. Maranas, and C. A. Floudas, “αbb: A global optimization method for general constrained nonconvex problems,” Journal of Global Optimization, vol. 7, no. 4, pp. 337-363, 1995. doi: 10.1007/BF01099647
A. Nemirovskii, “Several np-hard problems arising in robust stability analysis,” Mathematics of Control, Signals and Systems, vol. 6, pp. 99-105, 1993. doi: 10.1007/BF01211741
J. Rohn, “Checking positive definiteness or stability of symmetric interval matrices is nphard,” Commentationes Mathematicae Universitatis Carolinae, vol. 35, no. 4, pp. 795-797, 1994.
V. Kreinovich, A. V. Lakeyev, J. Rohn, and P. Kahl, Computational complexity and feasibility of data processing and interval computations. Springer Science & Business Media, 2013, vol. 10.
C. E. Gounaris and C. A. Floudas, “Tight convex underestimators for c2-continuous problems: Ii. multivariate functions,” Journal of Global Optimization, vol. 42, no. 1, pp. 69-89, 2008. doi: 10.1007/s10898-008-9288-8
M. Hladík, “On the efficient gerschgorin inclusion usage in the global optimization αBB method,” Journal of Global Optimization, vol. 61, no. 2, pp. 235-253, 2015. doi: 10.1007/s10898-014-0161-7
Q. Yuan, Z. He, and H. Leng, “An evolution strategy method for computing eigenvalue bounds of interval matrices,” Applied mathematics and computation, vol. 196, no. 1, pp. 257-265, 2008. doi: 10.1016/j.amc.2007.05.051
H. Leng and Z. He, “Computing eigenvalue bounds of structures with uncertain-but-nonrandom parameters by a method based on perturbation theory,” Communications in Numerical Methods in Engineering, vol. 23, no. 11, pp. 973-982, 2007. doi: 10.1002/cnm.936
M. Hladík, D. Daney, and E. Tsigaridas, “Bounds on real eigenvalues and singular values of interval matrices,” SIAM Journal on Matrix Analysis and Applications, vol. 31, no. 4, pp. 2116-2129, 2010. doi: 10.1137/090753991
H. Leng, Z. He, and Q. Yuan, “Computing bounds to real eigenvalues of real-interval matrices,” International journal for numerical methods in engineering, vol. 74, no. 4, pp. 523-530, 2008. doi: 10.1002/nme.2179
J. Rohn, “A handbook of results on interval linear problems,” Internet text available at http://www.cs.cas.cz/rohn/handbook, 2005.
L. Kolev and S. Petrakieva, “Assessing the stability of linear time-invariant continuous interval dynamic systems,” IEEE Transactions on Automatic Control, vol. 50, no. 3, pp. 393-397, 2005. doi: 10.1109/TAC.2005.843857
J. Rohn, “Stability of interval matrices: the real eigenvalue case,” IEEE transactions on automatic control, vol. 37, no. 10, pp. 1604-1605, 1992. doi: 10.1109/9.256393
L. Kolev, “Eigenvalue range determination for interval and parametric matrices,” International Journal of Circuit Theory and Applications, vol. 38, no. 10, pp. 1027-1061, 2010. doi: 10.1002/cta.609
G. H. Gloub and C. F. Van Loan, “Matrix computations,” Johns Hopkins Universtiy Press, 3rd edtion, 1996.
R. A. Horn and C. R. Johnson, Matrix analysis. Cambridge university press, 2012.
J. H. Wilkinson, The algebraic eigenvalue problem. Oxford University Press, Inc., 1988.
D. Hertz, “The extreme eigenvalues and stability of real symmetric interval matrices,” IEEE Transactions on automatic control, vol. 37, no. 4, pp. 532-535, 1992. doi: 10.1109/9.126593
M. Ouanes, H. A. Le Thi, T. P. Nguyen, and A. Zidna, “New quadratic lower bound for multivariate functions in global optimization,” Mathematics and Computers in Simulation, vol. 109, pp. 197-211, 2015. doi: 10.1016/j.matcom.2014.04.013
M. Jamil and X.-S. Yang, “A literature survey of benchmark functions for global optimisation problems,” International Journal of Mathematical Modelling and Numerical Optimisation, vol. 4, no. 2, pp. 150-194, 2013. doi: 10.1504/IJMMNO.2013.055204
Downloads
Published
Issue
Section
License
Copyright (c) YUJOR
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
