Construct · 1 fields · 1 citations

second-order cone programming: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
second-ordercone programming1 CONSTRUCTSecond-order coneLOBO · OPTIMIZATION

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Optimization

convex optimization of a linear objective under constraints requiring affine functions of the variables to lie in second-order, or Lorentz, cones.

In optimization, second-order cone programming refers to convex optimization of a linear objective under constraints requiring affine functions of the variables to lie in second-order, or Lorentz, cones. This meaning comes from Lobo (1998) in Linear Algebra and its Applications.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how second-order cone programming sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

objective2 fields · 5 citationsjingle · one word, two constructs

References

  1. Lobo, M. S., Vandenberghe, L., Boyd, S., & Lebret, H. (1998). Applications of second-order cone programming. Linear Algebra and its Applications, 284(1-3), 193-228. https://doi.org/10.1016/s0024-3795(98)10032-0

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct