Interior point and outer approximation methods for conic optimization
Any convex optimization problem may be represented as a conic problem that minimizes a linear function over the intersection of an affine subspace with a convex cone. An advantage of representing convex problems in conic form is that, under certain regularity conditions, a conic problem has a simple...
| Автор: | |
|---|---|
| Інші автори: | |
| Формат: | Дисертація |
| Опубліковано: |
Massachusetts Institute of Technology
2022
|
| Онлайн доступ: | https://hdl.handle.net/1721.1/144941 https://orcid.org/0000-0002-1305-0141 |