Geometric and algebraic approaches to mixed-integer polynomial optimization using sos programming

MaRDI QIDQ4568517zbMATH OpenFDO

Authors Sönke Behrends

Publication date 21 June 2018

Full work available at URL http://hdl.handle.net/11858/00-1735-0000-0023-3F9C-9

zbMATH Keywords

coercivitybranch and boundmixed integer nonlinear programmingnorm boundsreal algebravalid linear inequalitiesgeometric approaches to MINLPnonlinear cutting planessos programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Mixed integer programming (90C11)

Recommendations

• Norm bounds and underestimators for unconstrained polynomial integer minimization
• Box-constrained mixed-integer polynomial optimization using separable underestimators
• A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
• Polyhedral approximation in mixed-integer convex optimization
• Outer approximation with conic certificates for mixed-integer convex problems

Cited in

(3)

• On stability and the Łojasiewicz exponent at infinity of coercive polynomials.
• Norm bounds and underestimators for unconstrained polynomial integer minimization
• Generating valid linear inequalities for nonlinear programs via sums of squares

This page was built for publication: Geometric and algebraic approaches to mixed-integer polynomial optimization using sos programming

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