20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

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

English
2026-03-19
€179.62 €224.53

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

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 ... Full description

You May Also Like

Description

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.

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786131174155
Write Your Own Review
You're reviewing: Second-Order Cone Programming: Convex Optimization, Linear Program, Quadratically Constrained Quadratic Program
Your Rating:

Goodreads Reviews

€179.62 €224.53