A scaling algorithm for polynomial constraint satisfaction problems
From MaRDI portal
Publication:956593
DOI10.1007/S10898-008-9317-7zbMath1151.90549OpenAlexW2172276788MaRDI QIDQ956593
Publication date: 25 November 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9317-7
Related Items (4)
GLOMIQO: global mixed-integer quadratic optimizer ⋮ Constraint propagation on quadratic constraints ⋮ Rigorous filtering using linear relaxations ⋮ Rigorous verification of feasibility
Uses Software
Cites Work
- Unnamed Item
- On fast factorization pivoting methods for sparse symmetric indefinite systems
- Numerical stability of path tracing in polyhedral homotopy continuation methods
- Methods for scaling to doubly stochastic form
- A new pivoting strategy for Gaussian elimination
- Preconditioning Highly Indefinite and Nonsymmetric Matrices
- Rigorous Enclosures of Ellipsoids and Directed Cholesky Factorizations
- G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
- Scaling, sensitivity and stability in the numerical solution of quadratic eigenvalue problems
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Chemical equilibrium systems as numerical test problems
- Normwise Scaling of Second Order Polynomial Matrices
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- The Conditioning of Linearizations of Matrix Polynomials
- Weighted Matchings for Preconditioning Symmetric Indefinite Linear Systems
- On the Automatic Scaling of Matrices for Gaussian Elimination
This page was built for publication: A scaling algorithm for polynomial constraint satisfaction problems
