An SDP approach for non-convex quadraticfractional programming problems
博士 === 國立成功大學 === 數學系應用數學碩博士班 === 103 === In this dissertation, we are concerned with two types of quadratic fractional programming problems: one is a single ratio quadratic fractional problem with a twosided quadratic constraint (P) and the other is a sum-of-ratios problem (Q). Although we pose the...
Main Authors: | Van-BongNguyen, 阮文蓬 |
---|---|
Other Authors: | Ruey-Lin Sheu |
Format: | Others |
Language: | en_US |
Published: |
2015
|
Online Access: | http://ndltd.ncl.edu.tw/handle/13113879053888063873 |
Similar Items
-
Inexact SA Method for Constrained Stochastic Convex SDP and Application in Chinese Stock Market
by: Shuang Chen, et al.
Published: (2018-01-01) -
SdpAB are required for post-translational modification of SdpC
by: Perez Morales, Tiara G
Published: (2010) -
A multigrid approach to SDP relaxations of sparse polynomial optimization problems
by: Campos Salazar, Juan
Published: (2017) -
On Hierarchies of Strong SDP Relaxations for Combinatorial Optimization Problems
by: Benabbas, Siavosh
Published: (2012) -
On Hierarchies of Strong SDP Relaxations for Combinatorial Optimization Problems
by: Benabbas, Siavosh
Published: (2012)