Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

Second-Order Cone Programming: Convex Optimization, Linear Program, Quadratically Constrained Quadratic Program -

inglise keel
2026-03-19
157,17 € 224,53 €

-30% koodiga BOOKS

Meie tarnija laos

Saadetis 15-21 tööpäeva jooksul

30-päevane tagastamisõigus

High Quality Content by WIKIPEDIA articles! A second-order cone program (SOCP) is a convex optimization problem of the formwhere the problem parameters are 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}^{ptimes n}, and g in mathbb{R}^p. Here xinmathbb{R}^n is the optimization variable. When Ai = 0 for i = 1,dots,m, the SOCP red ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

High Quality Content by WIKIPEDIA articles! A second-order cone program (SOCP) is a convex optimization problem of the formwhere the problem parameters are 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}^{ptimes n}, and g in mathbb{R}^p. Here xinmathbb{R}^n is the optimization variable. When Ai = 0 for i = 1,dots,m, the SOCP reduces to a linear program. When ci = 0 for i = 1,dots,m, the SOCP is equivalent to a convex Quadratically constrained quadratic program. Semidefinite programs subsumes SOCPs as the SOCP constraints can be written as Linear Matrix Inequalities(LMI) and can be reformulated as an instance of semi definite program. SOCPs can be solved with great efficiency by interior point methods.

Lisateave

Kirjastaja OmniScriptum
Väljalaskeaasta 2026
Kaanetüüp Pehme kaanega
EAN 9786131174155
Kirjuta oma arvustus
Te vaatate: Second-Order Cone Programming: Convex Optimization, Linear Program, Quadratically Constrained Quadratic Program
Teie hinnang:

Goodreads'i arvustused

157,17 € 224,53 €