Generating valid linear inequalities for nonlinear programs via sums of squares

DOI10.1007/s10957-020-01736-4zbMath1457.90151OpenAlexW3048395748MaRDI QIDQ2198537

Anita Schöbel, Sönke Behrends

Publication date: 10 September 2020

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-020-01736-4

zbMATH Keywords

nonlinear optimizationsemi-infinite programmingvalid inequalitiespolynomial optimizationsum of squareshyperplane location

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Nonlinear programming (90C30) Semialgebraic sets and related spaces (14P10)

Uses Software

• Sostools
• SeDuMi
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
• On polynomial optimization over non-compact semi-algebraic sets
• Cutting planes in integer and mixed integer programming
• Semi-infinite programming
• Generalized semi-infinite programming: a tutorial
• Modified \(r\)-algorithm to find the global minimum of polynomial functions
• Median hyperplanes in normed spaces -- a survey
• Locating lines and hyperplanes. Theory and algorithms
• Solving mixed integer nonlinear programs by outer approximation
• Optimization over structured subsets of positive semidefinite matrices via column generation
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
• New solution approaches for the maximum-reliability stochastic network interdiction problem
• Outer-product-free sets for polynomial optimization and oracle-based cuts
• How to solve a semi-infinite optimization problem
• Global Optimization with Polynomials and the Problem of Moments
• Introduction to Semidefinite, Conic and Polynomial Optimization
• Sum of squares basis pursuit with linear and second order cone programming
• Semi-Infinite Programming: Theory, Methods, and Applications
• Outline of an algorithm for integer solutions to linear programs
• The Cutting-Plane Method for Solving Convex Programs
• Nonlinear Integer Programming
• Using Block Norms for Location Modeling
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Class of global minimum bounds of polynomial functions
• On the existence of optimal solutions to integer and mixed-integer programming problems
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Semidefinite Programming
• Semidefinite Optimization and Convex Algebraic Geometry
• Maximal Quadratic-Free Sets
• On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity
• Cut-Generating Functions and S-Free Sets
• Convex and Discrete Geometry
• Nonunique Lifting of Integer Variables in Minimal Inequalities
• Mixed-integer nonlinear optimization
• Convex Analysis
• There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Elementary closures for integer programs.
• Gauge distances and median hyperplanes

This page was built for publication: Generating valid linear inequalities for nonlinear programs via sums of squares