Enhancing convexification techniques for solving nonconvex quadratic programming problems
At the intersection of combinatorial and nonlinear optimization, quadratic programming (QP) plays an important role in practice and optimization theory. With wide-spread real-world applications including, but not limited to, engineering design, game theory, and economics, quadratic programming has m...
Main Author: | Qi, Xiaofei |
---|---|
Other Authors: | Tai Kang |
Format: | Thesis |
Language: | English |
Published: |
2017
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/72726 |
Similar Items
-
Nonconvex robust optimization
by: Teo, Kwong Meng
Published: (2008) -
Relaxation and exact algorithms for solving mixed integer-quadratic optimization problems
by: Tziligakis, Constantine Nikolaos
Published: (2005) -
Semidefinite relaxation based branch-and-bound method for nonconvex quadratic programming
by: Hu, Sha, S.M. Massachusetts Institute of Technology
Published: (2007) -
Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
by: Modaresi, Sina, et al.
Published: (2016) -
Global optimization of fractional programs with applications to engineering and management problems
by: Liu, Jianing
Published: (2017)