Semidefinite Programming Problems
碩士 === 國立交通大學 === 應用數學系所 === 98 === In semidefinite programming problems one minimizes a linear function subject to some constraints which requires an affine combination of symmetric matrices to be positive semidefinite. The constraints may not be linear but it is convex so semidefinite programming...
Main Authors: | Yeh, Bin, 葉彬 |
---|---|
Other Authors: | Weng, Chih-Wen |
Format: | Others |
Language: | en_US |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/55890764615335869363 |
Similar Items
-
On weighted paths for nonlinear semidefinite complementarity problems and newton methods for semidefinite programming
by: Zanjácomo, Paulo Régis
Published: (2008) -
Semidefinite programming for assignment and partitioning problems
by: Zhao, Qing.
Published: (2006) -
Semidefinite programming for assignment and partitioning problems
by: Zhao, Qing.
Published: (2006) -
A Semidefinite Programming Model for the Facility Layout Problem
by: Adams, Elspeth
Published: (2010) -
A Semidefinite Programming Model for the Facility Layout Problem
by: Adams, Elspeth
Published: (2010)