Math 2.0

Areas Optimization Topic

Conic and semidefinite programming

Summary

This topic is a part of optimization. It covers optimization over convex cones, conic duality, second-order cone and semidefinite programs, their failures of duality, and their use as relaxations.

About this page
Tag81MBM5WWS5
URIm2://81MBM5WWS5
Kindtopic
WritingW0 stub
MSC90C22, 90C25
Part ofOptimization
Changed17 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a same_as or a source (0 of 1)
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

History

Each change to this page, from its provenance log. A change by an agent names its run.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe whole nodetamnd

What links here

No page links to this page yet.