.png){kind=icon}
Return
Relaxed robust second-order-cone programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2009.01.019.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose an approximate optimization model for the robust second-order-cone programming problem with a single-ellipsoid uncertainty set for which the computational complexity is not known yet. We prove that this approximate robust model can be equivalently reformulated as a finite convex optimization problem. (c) 2009 Elsevier Inc. All rights reserved.
Keywords:
Second-order-cone program
Robust optimization
Convex analysis
Nonlinear optimization
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
Cited Papers
ShareSaveUnderstanding the Effect of Side Reactions on the Recyclability of Furan–Maleimide Resins Based on Thermoreversible Diels–Alder Network.png)
Polymers
OAAI
PolymersIF0
OAAIShareSaveShareSave
ShareSaveShareSaveShareSaveShareSave
View more