A scaling algorithm for polynomial constraint satisfaction problems

DOI10.1007/S10898-008-9317-7zbMATH Open1151.90549OpenAlexW2172276788MaRDI QIDQ956593FDOQ956593

Authors: Ferenc Domes, Arnold Neumaier 

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

Recommendations

• Polynomial Scaling
• Optimal Scaling of Generalized and Polynomial Eigenvalue Problems
• Scaling of general quadratic matrix equations
• Scaling: A general framework
• Calculation of zeros of a real polynomial using scaling of its coefficients

zbMATH Keywords

optimizationconstraint satisfaction problemsscaling algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Nonlinear programming (90C30)

Cites Work

• G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
• The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
• The Conditioning of Linearizations of Matrix Polynomials
• On fast factorization pivoting methods for sparse symmetric indefinite systems
• Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
• Rigorous enclosures of ellipsoids and directed Cholesky factorizations
• Preconditioning highly indefinite and nonsymmetric matrices
• Title not available (Why is that?)
• On the Automatic Scaling of Matrices for Gaussian Elimination
• Normwise Scaling of Second Order Polynomial Matrices
• Scaling, sensitivity and stability in the numerical solution of quadratic eigenvalue problems
• Numerical stability of path tracing in polyhedral homotopy continuation methods
• Methods for scaling to doubly stochastic form
• Chemical equilibrium systems as numerical test problems
• Weighted Matchings for Preconditioning Symmetric Indefinite Linear Systems
• A new pivoting strategy for Gaussian elimination

Cited In (5)

• Polynomial Scaling
• Rigorous filtering using linear relaxations
• Constraint propagation on quadratic constraints
• GLOMIQO: global mixed-integer quadratic optimizer
• Rigorous verification of feasibility

Uses Software

• PARDISO
• GLOPTLAB
• lpSolve
• HOMPACK

This page was built for publication: A scaling algorithm for polynomial constraint satisfaction problems

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