7.2

105 min

HD

The Roundup: No Way Out (2023)

Action, Bioskop Online, bioskop21, BioskopKeren, Cinemaindo, Comedy, Crime, Dewanonton, Drakor ID, DrakorIndo, Dunia21, DutaFilm, Ganool, gudangmovie, gudangmovie21, IndoXX1, Indoxxi, KorDramas, LayarKaca21, Layarkaca21 INDOXXI, LK21, LK21 XXI, Nonton drama, Nonton Movie, Pahe.in, PusatFilm21, Thriller, Korea

31 May 2023Lee Sang-yong

Trailer

Watch

7.7

186 min

HD

The Leopard (1963)

Bioskop Online, BioskopKeren, Cinemaindo, Dewanonton, Drakor ID, DrakorIndo, Drama, DramaQu, Dunia21, DutaFilm, Ganool, gudangmovie, IndoXX1, Indoxxi, KorDramas, LayarKaca21, Layarkaca21 INDOXXI, LK21, LK21 XXI, Nonton drama, Nonton Movie, Pahe.in, PusatFilm21, France, Italy

27 Mar 1963Luchino Visconti

Trailer

Watch

8.13

101 min

HD

Soul (2020)

Animation, Cinemaindo, Comedy, Drakor ID, DrakorIndo, DramaQu, Dunia21, Family, Fantasy, IndoXX1, Indoxxi, KorDramas, LayarKaca21, Layarkaca21 INDOXXI, LK21, Nonton drama, Nonton Movie, PusatFilm21, USA

25 Dec 2020Pete Docter

Trailer

Watch

Second-order cone programming GudangMovies21 Rebahinxxi LK21

A second-order cone program (SOCP) is a convex optimization problem of the form

minimize





f

T


x



{\displaystyle \ f^{T}x\ }


subject to




‖

A

i


x
+

b

i



‖

2


≤

c

i


T


x
+

d

i


,

i
=
1
,
…
,
m


{\displaystyle \lVert A_{i}x+b_{i}\rVert _{2}\leq c_{i}^{T}x+d_{i},\quad i=1,\dots ,m}





F
x
=
g



{\displaystyle Fx=g\ }


where the problem parameters are



f
∈


R


n


,


A

i


∈


R




n

i



×
n


,


b

i


∈


R



n

i




,


c

i


∈


R


n


,


d

i


∈

R

,

F
∈


R


p
×
n




{\displaystyle f\in \mathbb {R} ^{n},\ A_{i}\in \mathbb {R} ^{{n_{i}}\times n},\ b_{i}\in \mathbb {R} ^{n_{i}},\ c_{i}\in \mathbb {R} ^{n},\ d_{i}\in \mathbb {R} ,\ F\in \mathbb {R} ^{p\times n}}

, and



g
∈


R


p




{\displaystyle g\in \mathbb {R} ^{p}}

.



x
∈


R


n




{\displaystyle x\in \mathbb {R} ^{n}}

is the optimization variable.




‖
x

‖

2




{\displaystyle \lVert x\rVert _{2}}

is the Euclidean norm and






T




{\displaystyle ^{T}}

indicates transpose. The "second-order cone" in SOCP arises from the constraints, which are equivalent to requiring the affine function



(
A
x
+
b
,

c

T


x
+
d
)


{\displaystyle (Ax+b,c^{T}x+d)}

to lie in the second-order cone in





R



n

i


+
1




{\displaystyle \mathbb {R} ^{n_{i}+1}}

.
SOCPs can be solved by interior point methods and in general, can be solved more efficiently than semidefinite programming (SDP) problems. Some engineering applications of SOCP include filter design, antenna array weight design, truss design, and grasping force optimization in robotics. Applications in quantitative finance include portfolio optimization; some market impact constraints, because they are not linear, cannot be solved by quadratic programming but can be formulated as SOCP problems.




Second-order cone


The standard or unit second-order cone of dimension



n
+
1


{\displaystyle n+1}

is defined as







C



n
+
1


=

{



[



x




t



]




|


x
∈


R


n


,
t
∈

R

,
‖
x

‖

2


≤
t

}



{\displaystyle {\mathcal {C}}_{n+1}=\left\{{\begin{bmatrix}x\\t\end{bmatrix}}{\Bigg |}x\in \mathbb {R} ^{n},t\in \mathbb {R} ,\|x\|_{2}\leq t\right\}}

.
The second-order cone is also known by quadratic cone or ice-cream cone or Lorentz cone. The standard second-order cone in





R


3




{\displaystyle \mathbb {R} ^{3}}

is




{

(
x
,
y
,
z
)


|





x

2


+

y

2




≤
z

}



{\displaystyle \left\{(x,y,z){\Big |}{\sqrt {x^{2}+y^{2}}}\leq z\right\}}

.
The set of points satisfying a second-order cone constraint is the inverse image of the unit second-order cone under an affine mapping:




‖

A

i


x
+

b

i



‖

2


≤

c

i


T


x
+

d

i


⇔


[




A

i







c

i


T





]


x
+


[




b

i







d

i





]


∈



C




n

i


+
1




{\displaystyle \lVert A_{i}x+b_{i}\rVert _{2}\leq c_{i}^{T}x+d_{i}\Leftrightarrow {\begin{bmatrix}A_{i}\\c_{i}^{T}\end{bmatrix}}x+{\begin{bmatrix}b_{i}\\d_{i}\end{bmatrix}}\in {\mathcal {C}}_{n_{i}+1}}


and hence is convex.
The second-order cone can be embedded in the cone of the positive semidefinite matrices since





|


|

x

|


|

≤
t
⇔


[



t
I


x





x

T




t



]


≽
0
,


{\displaystyle ||x||\leq t\Leftrightarrow {\begin{bmatrix}tI&x\\x^{T}&t\end{bmatrix}}\succcurlyeq 0,}


i.e., a second-order cone constraint is equivalent to a linear matrix inequality (Here



M
≽
0


{\displaystyle M\succcurlyeq 0}

means



M


{\displaystyle M}

is semidefinite matrix). Similarly, we also have,




‖

A

i


x
+

b

i



‖

2


≤

c

i


T


x
+

d

i


⇔


[



(

c

i


T


x
+

d

i


)
I



A

i


x
+

b

i






(

A

i


x
+

b

i



)

T





c

i


T


x
+

d

i





]


≽
0


{\displaystyle \lVert A_{i}x+b_{i}\rVert _{2}\leq c_{i}^{T}x+d_{i}\Leftrightarrow {\begin{bmatrix}(c_{i}^{T}x+d_{i})I&A_{i}x+b_{i}\\(A_{i}x+b_{i})^{T}&c_{i}^{T}x+d_{i}\end{bmatrix}}\succcurlyeq 0}

.




Relation with other optimization problems



When




A

i


=
0


{\displaystyle A_{i}=0}

for



i
=
1
,
…
,
m


{\displaystyle i=1,\dots ,m}

, the SOCP reduces to a linear program. When




c

i


=
0


{\displaystyle c_{i}=0}

for



i
=
1
,
…
,
m


{\displaystyle i=1,\dots ,m}

, the SOCP is equivalent to a convex quadratically constrained linear program.
Convex quadratically constrained quadratic programs can also be formulated as SOCPs by reformulating the objective function as a constraint. Semidefinite programming subsumes SOCPs as the SOCP constraints can be written as linear matrix inequalities (LMI) and can be reformulated as an instance of semidefinite program. The converse, however, is not valid: there are positive semidefinite cones that do not admit any second-order cone representation.
Any closed convex semialgebraic set in the plane can be written as a feasible region of a SOCP,. However, it is known that there exist convex semialgebraic sets of higher dimension that are not representable by SDPs; that is, there exist convex semialgebraic sets that can not be written as the feasible region of a SDP (nor, a fortiori, as the feasible region of a SOCP).




Examples






= Quadratic constraint

=
Consider a convex quadratic constraint of the form





x

T


A
x
+

b

T


x
+
c
≤
0.


{\displaystyle x^{T}Ax+b^{T}x+c\leq 0.}


This is equivalent to the SOCP constraint




‖

A

1

/

2


x
+


1
2



A

−
1

/

2


b
‖
≤


(



1
4



b

T



A

−
1


b
−
c

)



1
2





{\displaystyle \lVert A^{1/2}x+{\frac {1}{2}}A^{-1/2}b\rVert \leq \left({\frac {1}{4}}b^{T}A^{-1}b-c\right)^{\frac {1}{2}}}





= Stochastic linear programming

=
Consider a stochastic linear program in inequality form

minimize





c

T


x



{\displaystyle \ c^{T}x\ }


subject to





P

(

a

i


T


x
≤

b

i


)
≥
p
,

i
=
1
,
…
,
m


{\displaystyle \mathbb {P} (a_{i}^{T}x\leq b_{i})\geq p,\quad i=1,\dots ,m}


where the parameters




a

i





{\displaystyle a_{i}\ }

are independent Gaussian random vectors with mean







a
¯




i




{\displaystyle {\bar {a}}_{i}}

and covariance




Σ

i





{\displaystyle \Sigma _{i}\ }

and



p
≥
0.5


{\displaystyle p\geq 0.5}

. This problem can be expressed as the SOCP

minimize





c

T


x



{\displaystyle \ c^{T}x\ }


subject to








a
¯




i


T


x
+

Φ

−
1


(
p
)
‖

Σ

i


1

/

2


x

‖

2


≤

b

i


,

i
=
1
,
…
,
m


{\displaystyle {\bar {a}}_{i}^{T}x+\Phi ^{-1}(p)\lVert \Sigma _{i}^{1/2}x\rVert _{2}\leq b_{i},\quad i=1,\dots ,m}


where




Φ

−
1


(
⋅
)



{\displaystyle \Phi ^{-1}(\cdot )\ }

is the inverse normal cumulative distribution function.




= Stochastic second-order cone programming

=
We refer to second-order cone programs
as deterministic second-order cone programs since data defining them are deterministic.
Stochastic second-order cone programs are a class of optimization problems that are defined to handle uncertainty in data defining deterministic second-order cone programs.




= Other examples

=
Other modeling examples are available at the MOSEK modeling cookbook.




Solvers and scripting (programming) languages






See also


Power cones are generalizations of quadratic cones to powers other than 2.




References

Kata Kunci Pencarian:

• Second-order cone programming
• Quadratically constrained quadratic program
• Convex optimization
• FICO Xpress
• MOSEK
• Mathematical optimization
• Tracking error
• Nl (format)
• Herfindahl–Hirschman index
• CPLEX

Second-order cone programming | Semantic Scholar

Second-order cone programming | Semantic Scholar

Second-order cone programming | Semantic Scholar

Second-order cone programming | Semantic Scholar

(PDF) SECOND-ORDER CONE PROGRAMMING | AARF Publications Journals ...

(PDF) Second-order cone programming

Solving Convex Problems with Second-order Cone Programming (SOCP) - NAG

Dual of a Second Order Cone Program (SOCP) - Optimization

Dual of a Second Order Cone Program (SOCP) - Optimization

(PDF) Applications of Second-Order Cone Programming | Lebret Herve ...

Mixed-Integer Second-Order Cone Programming: A Survey

Second-order cone problem using CVXPY - CVX Forum: a community-driven ...