Separated Continuous Conic Programming: Strong Duality and an Approximation Algorithm

Motivated by recent applications in robust optimization and in sign-constrained linear-quadratic control, we study in this paper a new class of optimization problems called separated continuous conic programming (SCCP). Focusing on a symmetric primal-dual pair, we develop a strong duality theory for...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	SIAM journal on control and optimization Ročník 48; číslo 4; s. 2118 - 2138
Hlavní autori:	Wang, Xiaoqing, Zhang, Shuzhong, Yao, David D.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2009
Predmet:	Algorithms Approximation Conics Discretization Focusing Mathematical analysis Optimization Optimization algorithms Programming Quadratic programming Studies
ISSN:	0363-0129, 1095-7138
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!