Tolerances, robustness and parametrization of matrix properties related to optimization problems
From MaRDI portal
Publication:4634170
DOI10.1080/02331934.2018.1545837zbMath1431.15015arXiv1709.07629OpenAlexW2950206208MaRDI QIDQ4634170
Publication date: 7 May 2019
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.07629
Sensitivity, stability, parametric optimization (90C31) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Perturbation theory of linear operators (47A55) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items (3)
Unnamed Item ⋮ Stability of the linear complementarity problem properties under interval uncertainty ⋮ Regularity radius: Properties, approximation and a not a priori exponential algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scientific computing, computer arithmetic, and validated numerics. 16th international symposium, SCAN 2014, Würzburg, Germany, September 21--26, 2014. Revised selected papers
- Radii of solvability and unsolvability of linear systems
- Invariance of total nonnegativity of a matrix under entry-wise perturbation and subdirect sum of totally nonnegative matrices
- Inverse \(M\)-matrices. II
- Criteria for sign regularity of sets of matrices
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Extension of linear-quadratic control, optimization and matrix theory
- M-matrix characterizations. I: nonsingular M-matrices
- The P-matrix problem is co-NP-complete
- Advances in sensitivity analysis and parametric programming
- Computational complexity and feasibility of data processing and interval computations
- Checking robust nonsingularity is NP-hard
- Computation of error bounds for P-matrix linear complementarity problems
- Invariance of total positivity of a matrix under entry-wise perturbation and completion problems
- Bounds on Real Eigenvalues and Singular Values of Interval Matrices
- Tolerance analysis in linear systems and linear programming
- Matrix Analysis
- The Tolerance Approach to Sensitivity Analysis in Linear Programming
- Computing the norm ∥A∥∞,1 is NP-hard∗
- A Linear Complementarity Problem with a P-Matrix
- Linear Optimization Problems with Inexact Data
- Numerical Linear Algebra
- A Fourth-Order Finite-Difference Approximation for the Fixed Membrane Eigenproblem
This page was built for publication: Tolerances, robustness and parametrization of matrix properties related to optimization problems
