Computability and complexity of polynomial optimization problems

MaRDI QIDQ4026986zbMATH OpenFDO

Authors Joos Heintz, Teresa Krick, Reinhard Mandel, Pablo Solernó, Bernd Bank

Publication date 21 February 1993

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Complexity of integer quasiconvex polynomial optimization
• Integer Polynomial Optimization in Fixed Dimension
• Une borne optimale pour la programmation entière quasi-convexe
• scientific article; zbMATH DE number 3922374
• Intrinsic complexity estimates in polynomial optimization

Cited in

(12)

• Integer optimization on convex semialgebraic sets
• Intrinsic complexity estimates in polynomial optimization
• Complexity of integer quasiconvex polynomial optimization
• scientific article; zbMATH DE number 5799870 (Why is no real title available?)
• scientific article; zbMATH DE number 3843508 (Why is no real title available?)
• scientific article; zbMATH DE number 782052 (Why is no real title available?)
• On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications
• Integer Polynomial Optimization in Fixed Dimension
• Theory and Applications of Models of Computation
• Complexity, exactness, and rationality in polynomial optimization
• Complexity, exactness, and rationality in polynomial optimization
• A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization

This page was built for publication: Computability and complexity of polynomial optimization problems

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