2014
DOI: 10.1016/j.amc.2014.10.015
|View full text |Cite
|
Sign up to set email alerts
|

Decomposition-based interior point methods for stochastic quadratic second-order cone programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 12 publications
(7 citation statements)
references
References 20 publications
0
7
0
Order By: Relevance
“…In this case, the SMISOCP problem (3,4) is reduced to the two-stage SSOCP problem with recourse [20]. SSOCP is a convex optimization problem that can be solved in several methods in polynomial time (see [28]- [31]). In fact, Ax ⪰ k b if and only if the vector Ax − b is nonnegative, i.e., all its components belong to the first-dimensional second-order cone Q 1 := {t ∈ R : t ≥ 0}.…”
Section: )mentioning
confidence: 99%
See 1 more Smart Citation
“…In this case, the SMISOCP problem (3,4) is reduced to the two-stage SSOCP problem with recourse [20]. SSOCP is a convex optimization problem that can be solved in several methods in polynomial time (see [28]- [31]). In fact, Ax ⪰ k b if and only if the vector Ax − b is nonnegative, i.e., all its components belong to the first-dimensional second-order cone Q 1 := {t ∈ R : t ≥ 0}.…”
Section: )mentioning
confidence: 99%
“…(28) Because the constraints in the first-stage problem (27) are linear with integer variables and without the use of second-order cone relaxations, a solution for Model (27,28) is now possible. One way to approach this model is by applying scenario-based cuts proposed in [55].…”
Section: Optimal Infrastructure Problem For Electric Vehicles With Battery Swap Technologymentioning
confidence: 99%
“…Note that the constraints in ( [3,4]) are non-positive second-order cone constraints while the common practice in the deterministic second-order cone programming literature is to use non-negative second-order cone constraints. So for convenience we redefine d (k) as d (k) := p k d (k) for k = 1, 2, .…”
Section: Introductionmentioning
confidence: 99%
“…Stochastic second-order cone programming with recourse is a class of optimization problems defined to formulate many applications of DSOCP with uncertain data [2]. Second-order cone programming is a special convex programming model [3], and is one of the important optimization methods in mathematics. The method has been applied in power systems [4,5].…”
Section: Introductionmentioning
confidence: 99%
“…Second-order cone programming is a special convex programming model [3], and is one of the important optimization methods in mathematics. The method has been applied in power systems [4,5].…”
Section: Introductionmentioning
confidence: 99%