Basis stability in interval quadratic programming

DOI10.1016/J.IJAR.2026.109756MaRDI QIDQ7308944zbMATH OpenFDO

Authors Cyril Kotecký, Milan Hladík

Publication date 4 August 2026

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IJAR.2026.109756

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Quadratic programming (90C20) Convex programming (90C25)

Cites work

• Calculation of exact bounds for the solution set of linear interval systems
• Checking robust nonsingularity is NP-hard
• Checking weak and strong optimality of the solution to interval convex quadratic program
• Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form
• Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
• Description of Symmetric and Skew–Symmetric Solution Set
• Forty necessary and sufficient conditions for regularity of interval matrices: A survey
• Global optimality condition for quadratic optimization problems under data uncertainty
• How to determine basis stability in interval linear programming
• scientific article; zbMATH DE number 3474842 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 869738 (Why is no real title available?)
• Interval analytic treatment of convex programming problems
• Interval linear programming and extensions
• Interval Methods for Systems of Equations
• Linear interval inequalities
• New method for computing the upper bound of optimal value in interval quadratic program
• New operator and method for solving real preconditioned interval linear equations
• Numerical solution of saddle point problems
• On the optimal solution set in interval linear programming
• Parametric interval algebraic systems
• Positive Definiteness and Stability of Interval Matrices
• Some properties of the lower bound of optimal values in interval convex quadratic programming
• Some results on the upper bound of optimal values in interval convex quadratic programming
• Weak and strong solvability of interval linear systems of equations and inequalities

This page was built for publication: Basis stability in interval quadratic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7308944)