New Conic Optimization Techniques for Solving Binary Polynomial Programming Problems
Polynomial programming, a class of non-linear programming where the objective and the constraints are multivariate polynomials, has attracted the attention of many researchers in the past decade. Polynomial programming is a powerful modeling tool that captures various optimization models. Due to the...
Main Author: | Ghaddar, Bissan |
---|---|
Language: | en |
Published: |
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/10012/6139 |
Similar Items
-
New Conic Optimization Techniques for Solving Binary Polynomial Programming Problems
by: Ghaddar, Bissan
Published: (2011) -
A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem
by: Ghaddar, Bissan
Published: (2007) -
A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem
by: Ghaddar, Bissan
Published: (2007) -
ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATION
by: Igor Klep, et al.
Published: (2012-12-01) -
Global Optimization of Monotonic Programs: Applications in Polynomial and Stochastic Programming.
by: Cheon, Myun-Seok
Published: (2005)