Relaxed robust second-order-cone programming

I Averbakh; Yun-Bin Zhao

doi:10.1016/j.amc.2009.01.019

Relaxed robust second-order-cone programming

I Averbakh
, Yun-Bin Zhao

Mathematics

Research output: Contribution to journal › Article

Abstract

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.

Original language	English
Pages (from-to)	387-397
Number of pages	11
Journal	Applied Mathematics and Computation
Volume	210
Issue number	2
DOIs	https://doi.org/10.1016/j.amc.2009.01.019
Publication status	Published - 1 Apr 2009

Keywords

Robust optimization
Convex analysis
Nonlinear optimization
Second-order-cone program

Access to Document

10.1016/j.amc.2009.01.019

Cite this

@article{8f90ca2f1dc74c959562a800d7048def,

title = "Relaxed robust second-order-cone programming",

abstract = "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 = "Robust optimization, Convex analysis, Nonlinear optimization, Second-order-cone program",

author = "I Averbakh and Yun-Bin Zhao",

year = "2009",

month = apr,

day = "1",

doi = "10.1016/j.amc.2009.01.019",

language = "English",

volume = "210",

pages = "387--397",

journal = "Applied Mathematics and Computation",

issn = "1873-5649",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Relaxed robust second-order-cone programming

AU - Averbakh, I

AU - Zhao, Yun-Bin

PY - 2009/4/1

Y1 - 2009/4/1

N2 - 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.

AB - 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.

KW - Robust optimization

KW - Convex analysis

KW - Nonlinear optimization

KW - Second-order-cone program

U2 - 10.1016/j.amc.2009.01.019

DO - 10.1016/j.amc.2009.01.019

M3 - Article

SN - 1873-5649

VL - 210

SP - 387

EP - 397

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

IS - 2

ER -

Relaxed robust second-order-cone programming

Abstract

Keywords

Access to Document

Fingerprint

Cite this