Exploiting equalities in polynomial programming

DOI10.1016/j.orl.2007.05.011zbMath1163.90755OpenAlexW2035949967WikidataQ58051159 ScholiaQ58051159MaRDI QIDQ935230

Luis F. Zuluaga, Javier F. Peña, Juan Carlos Vera

Publication date: 6 August 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2007.05.011

zbMATH Keywords

0-1 programmingpolynomial programmingstable set problemLMI approximations

Mathematics Subject Classification ID

Nonlinear programming (90C30) Boolean programming (90C09)

Related Items (4)

Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 ⋮ An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming ⋮ Univariate parameterization for global optimization of mixed-integer polynomial problems ⋮ A dynamic inequality generation scheme for polynomial programming

Uses Software

• SeDuMi
• SDPT3
• SDPARA

Cites Work

• Unnamed Item
• Unnamed Item
• Semidefinite representations for finite varieties
• Large-scale semidefinite programming via a saddle point mirror-prox algorithm
• Representing polynomials by positive linear functions on compact convex polyhedra
• The \(K\)-moment problem for compact semi-algebraic sets
• Semidefinite programming relaxations for semialgebraic problems
• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
• Bounds on measures satisfying moment conditions.
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Sums of squares on real algebraic surfaces
• Minimizing polynomials via sum of squares over the gradient ideal
• An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
• Approximation of the Stability Number of a Graph via Copositive Programming
• Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials
• On the Relation Between Option and Stock Prices: A Convex Optimization Approach
• Class of global minimum bounds of polynomial functions
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• LMI Approximations for Cones of Positive Semidefinite Forms
• Semidefinite Programming vs. LP Relaxations for Polynomial Programming
• On Cones of Nonnegative Quadratic Functions

This page was built for publication: Exploiting equalities in polynomial programming