Stochastic separated continuous conic programming: strong duality and a solution method (Q1719330)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7017536
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Stochastic separated continuous conic programming: strong duality and a solution method |
scientific article; zbMATH DE number 7017536 |
Statements
Stochastic separated continuous conic programming: strong duality and a solution method (English)
0 references
8 February 2019
0 references
Summary: We study a new class of optimization problems called \textit{stochastic separated continuous conic programming} (SSCCP). SSCCP is an extension to the optimization model called \textit{separated continuous conic programming} (SCCP) which has applications in robust optimization and sign-constrained linear-quadratic control. Based on the relationship among SSCCP, its dual, and their discretization counterparts, we develop a strong duality theory for the SSCCP. We also suggest a polynomial-time approximation algorithm that solves the SSCCP to any predefined accuracy.
0 references
0 references
0.9107918739318848
0 references
0.85310959815979
0 references
0.7608410716056824
0 references
0.7572055459022522
0 references
