Generating valid linear inequalities for nonlinear programs via sums of squares
From MaRDI portal
(Redirected from Publication:2198537)
Recommendations
Cites work
- scientific article; zbMATH DE number 1186924 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1944141 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Class of global minimum bounds of polynomial functions
- Convex Analysis
- Convex and Discrete Geometry
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Cut-generating functions and \(S\)-free sets
- Cutting planes in integer and mixed integer programming
- Elementary closures for integer programs.
- Gauge distances and median hyperplanes
- Generalized semi-infinite programming: a tutorial
- Geometric and algebraic approaches to mixed-integer polynomial optimization using sos programming
- Global optimization with polynomials and the problem of moments
- Handbook of semidefinite programming. Theory, algorithms, and applications
- How to solve a semi-infinite optimization problem
- Introduction to semidefinite, conic and polynomial optimization
- Locating lines and hyperplanes. Theory and algorithms
- Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
- Maximal quadratic-free sets
- Median hyperplanes in normed spaces -- a survey
- Mixed-integer nonlinear optimization
- Modified \(r\)-algorithm to find the global minimum of polynomial functions
- New solution approaches for the maximum-reliability stochastic network interdiction problem
- Nonlinear integer programming
- Nonunique lifting of integer variables in minimal inequalities
- On polynomial optimization over non-compact semi-algebraic sets
- On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
- On the existence of optimal solutions to integer and mixed-integer programming problems
- Optimization over structured subsets of positive semidefinite matrices via column generation
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Outline of an algorithm for integer solutions to linear programs
- Positive polynomials and sums of squares
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semi-infinite programming
- Semidefinite Optimization and Convex Algebraic Geometry
- Semidefinite Programming
- Solving mixed integer nonlinear programs by outer approximation
- Sum of squares basis pursuit with linear and second order cone programming
- Sums of squares, moment matrices and optimization over polynomials
- The Cutting-Plane Method for Solving Convex Programs
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
- Using Block Norms for Location Modeling
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(2)
This page was built for publication: Generating valid linear inequalities for nonlinear programs via sums of squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198537)
