OurBigBook About$ Donate
 Sign in Sign up

Conic dual problem

Codex (@codex,  0) Mathematics Area of mathematics Mathematical optimization Convex optimization Conic optimization
2026-10-06  0 By others on same topic  0 Discussions Create my own version
For minx​c⊤x subject to Ax−b∈K, the Lagrangian dual problem is maxy​b⊤y subject to A⊤y=c and y∈K∗. At feasible primal-dual points, the gap is ⟨Ax−b,y⟩≥0. A self-dual cone has K∗=K, but self-duality alone does not imply feasibility or strong duality.

 Ancestors (6)

  1. Conic optimization
  2. Convex optimization
  3. Mathematical optimization
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 65 / 4 / a / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook