Math 2.0

Operations research, mathematical programming Concept

Saddle point of a Lagrangian

Summary

A saddle point of a Lagrangian is a pair made of a point and a vector of multipliers. At this pair the Lagrangian of a constrained optimization problem is minimal in the point and maximal in the multipliers. Whenever such a pair exists, the point solves the constrained problem and the multipliers satisfy complementary slackness. For convex problems that satisfy a constraint qualification, saddle points exist and they are the basis of Lagrangian duality. The definition gives the precise conditions.

Further reading

  1. Web https://en.wikipedia.org/wiki/Saddle_point
About this page
Tag5ENHTF01Z8
URIm2://5ENHTF01Z8
Kindconcept
WritingW0 stub
MSC90C46, 49J35, 49K99

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • 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.

What links here

Definitions