Positive Semidefiniteness and Positive Definiteness of a Linear Parametric Interval Matrix

We consider a symmetric matrix, the entries of which depend linearly on some parameters. The domains of the parameters are compact real intervals. We investigate the problem of checking whether for each (or some) setting of the parameters, the matrix is positive definite (or positive semidefinite). We state a characterization in the form of equivalent conditions, and also propose some computationally cheap sufficient / necessary conditions. Our results extend the classical results on positive (semi-)definiteness of interval matrices. They may be useful for checking convexity or non-convexity in global optimization methods based on branch and bound framework and using interval techniques.

[1]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[2]  Bernd Grtner,et al.  Approximation Algorithms and Semidefinite Programming , 2012 .

[3]  R. B. Kearfott.  Rigorous Global Search: Continuous Problems , 1996 .

[4]  Panos M. Pardalos,et al.  Encyclopedia of Optimization , 2006 .

[5]  Christodoulos A. Floudas,et al.  A review of recent advances in global optimization , 2009, J. Glob. Optim..

[6]  Martin Mönnigmann.  Fast Calculation of Spectral Bounds for Hessian Matrices on Hyperrectangles , 2011, SIAM J. Matrix Anal. Appl..

[7]  Eldon Hansen,et al.  Global optimization using interval analysis , 1992, Pure and applied mathematics.

[8]  V. Kreinovich.  Computational Complexity and Feasibility of Data Processing and Interval Computations , 1997 .

[9]  Boglárka G.-Tóth,et al.  Introduction to Nonlinear and Global Optimization , 2010 .

[10]  Milan Hladík,et al.  Bounds on eigenvalues of real and complex interval matrices , 2013, Appl. Math. Comput..

[11]  A. Neumaier.  Complete search in continuous global optimization and constraint satisfaction , 2004, Acta Numerica.

[12]  Tapio Westerlund,et al.  New methods for calculating αBB-type underestimators , 2014 .

[13]  Milan Hladík,et al.  Characterizing and approximating eigenvalue sets of symmetric interval matrices , 2011, Comput. Math. Appl..

[14]  Milan Hladík,et al.  Bounds on Real Eigenvalues and Singular Values of Interval Matrices , 2010, SIAM J. Matrix Anal. Appl..

[15]  Huinan Leng,et al.  Real eigenvalue bounds of standard and generalized real interval eigenvalue problems , 2014, Appl. Math. Comput..

[16]  W. Liu.  Necessary and sufficient conditions for the positive definiteness and stability of symmetric interval matrices , 2009, 2009 Chinese Control and Decision Conference.

[17]  Milan Hlad.  On the Efficient Gerschgorin Inclusion Usage in the Global OptimizationBB Method , 2013 .

[18]  J. Rohn.  Positive Definiteness and Stability of Interval Matrices , 1994, SIAM J. Matrix Anal. Appl..

[20]  M. Hladík.  On the Efficient Gerschgorin Inclusion Usage in the Global Optimization {\alpha}BB Method , 2013 .

[22]  Lubomir V. Kolev.  Determining the Positive Definiteness Margin of Interval Matrices , 2007, Reliab. Comput..

[23]  Milan Hladík,et al.  Outer enclosures to the parametric AE solution set , 2013, Soft Comput..

[24]  Milan Hladík,et al.  On the efficient Gerschgorin inclusion usage in the global optimization $$\alpha \hbox {BB}$$αBB method , 2013, J. Glob. Optim..

[25]  Christodoulos A. Floudas,et al.  Deterministic Global Optimization: Theory, Methods and (NONCONVEX OPTIMIZATION AND ITS APPLICATIONS Volume 37) (Nonconvex Optimization and Its Applications) , 2005 .

[26]  Jiri Rohn,et al.  Sufficient Conditions for Regularity and Singularity of Interval Matrices , 1999, SIAM J. Matrix Anal. Appl..

[27]  Christodoulos A. Floudas,et al.  Deterministic Global Optimization , 1990 .

[28]  Svatopluk Poljak,et al.  Checking robust nonsingularity is NP-hard , 1993, Math. Control. Signals Syst..

[29]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .

[30]  Lubomir V. Kolev.  Eigenvalue range determination for interval and parametric matrices , 2010, Int. J. Circuit Theory Appl..

[31]  Luc Jaulin,et al.  Contracting Optimally an Interval Matrix without Loosing Any Positive Semi-Definite Matrix Is a Tractable Problem , 2005, Reliab. Comput..

[32]  J. Garloff,et al.  Intervals of P-matrices and related matrices , 1984 .

[33]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[34]  Siegfried M. Rump,et al.  INTLAB - INTerval LABoratory , 1998, SCAN.

[35]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[36]  Günter Mayer.  An Oettli-Prager-Like Theorem for the Symmetric Solution Set and for Related Solution Sets , 2012, SIAM J. Matrix Anal. Appl..

[37]  Lubomir V. Kolev.  Outer Interval Solution of the Eigenvalue Problem under General Form Parametric Dependencies , 2006, Reliab. Comput..

[38]  Milan Hladík,et al.  Enclosures for the solution set of parametric interval linear systems , 2012, Int. J. Appl. Math. Comput. Sci..

[39]  Tapio Westerlund,et al.  New methods for calculating $$\alpha $$BB-type underestimators , 2014, J. Glob. Optim..

[40]  Michael Zimmer,et al.  Solvers for the verified solution of parametric linear systems , 2011, Computing.

[41]  Evgenija D. Popova.  Explicit Description of AE Solution Sets for Parametric Linear Systems , 2012, SIAM J. Matrix Anal. Appl..

[42]  M. Fiedler,et al.  Linear Optimization Problems with Inexact Data , 2006 .

[43]  D. Hertz.  The extreme eigenvalues and stability of real symmetric interval matrices , 1992 .

[44]  Jiri Rohn,et al.  A Handbook of Results on Interval Linear Problems , 2005 .

[45]  Iwona Skalna.  Strong regularity of parametric interval matrices , 2017 .

[46]  Christodoulos A. Floudas,et al.  Deterministic global optimization - theory, methods and applications , 2010, Nonconvex optimization and its applications.