Continuous methods for convex programming and convex semidefinite programming
In this thesis, we study several interior point continuous trajectories for linearly constrained convex programming (CP) and convex semidefinite programming (SDP). The continuous trajectories are characterized as the solution trajectories of corresponding ordinary differential equation (ODE) systems...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
HKBU Institutional Repository
2017
|
| Subjects: | |
| Online Access: | https://repository.hkbu.edu.hk/etd_oa/422 https://repository.hkbu.edu.hk/cgi/viewcontent.cgi?article=1422&context=etd_oa |