Global Optimization with Polynomials
The class of POP (Polynomial Optimization Problems) covers a wide rang of optimization problems such as 0 - 1 integer linear and quadratic programs, nonconvex quadratic programs and bilinear matrix inequalities. In this paper, we review some methods on solving the unconstraint case: minimize a real-...
Main Author: | Han, Deren |
---|---|
Format: | Article |
Language: | en_US |
Published: |
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/3883 |
Similar Items
-
A Global Optimization Algorithm for Solving Linearly Constrained Quadratic Fractional Problems
by: Zhijun Xu, et al.
Published: (2021-11-01) -
ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATION
by: Igor Klep, et al.
Published: (2012-12-01) -
New results on eliminating the duality gap of the second-order-cone reformulation for extended trust-region subproblem with two intersecting cuts
by: Wang, Meiling
Published: (2024-11-01) -
Array pattern synthesis using semidefinite programming and a bisection method
by: Jong‐Ho Lee, et al.
Published: (2019-05-01) -
Distributed Optimal Control of DC Network Using Convex Relaxation Techniques
by: Yongbo Fu, et al.
Published: (2024-12-01)