Duality Gap Estimation for Box Constrained Quadratic Programs via Weighted Distance Measures
碩士 === 國立成功大學 === 數學系應用數學碩博士班 === 102 === In this thesis, we estimate the gap between a box constrained quadratic program and its SDP relaxation. The problem includes the binary quadratic program as a special case and is thus in general NP-hard. Applying the saddle point theorem, we show that the du...
Main Authors: | Chih-IWeng, 翁之翊 |
---|---|
Other Authors: | Ruey-Lin Sheu |
Format: | Others |
Language: | en_US |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/59874691302003868414 |
Similar Items
-
The quadratically constrained quadratic program
by: Van Voorhis Timothy P.
Published: (2008) -
Canonical Duality for Box Constrained Nonconvex and Nonsmooth Optimization Problems
by: Jing Liu, et al.
Published: (2015-01-01) -
An Accelerated Proximal Gradient Algorithm for Singly Linearly Constrained Quadratic Programs with Box Constraints
by: Congying Han, et al.
Published: (2013-01-01) -
Some remarks on duality and optimality of a class of constrained convex quadratic minimization problems
by: Roy Sudipta, et al.
Published: (2017-01-01) -
On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming
by: Ding, Yichuan
Published: (2007)