A primal-dual infeasible interior point algorithm for linearlyconstrained convex programming
碩士 === 國立中山大學 === 應用數學系研究所 === 102 === Convex minimization has applications in a wide range of disciplines, such as automatic control systems, estimation and signal processing, communications and net- works, electronic circuit design, data analysis and modeling, statistics (optimal design), and nan...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/vhwcyg |