Lagrange duality

Target entity: Lagrange duality
Context triple: [Convex Optimization, topic, Lagrange duality]

• A. Kantorovich duality
  Kantorovich duality is a fundamental result in optimal transport theory that characterizes the optimal transport cost as the supremum of a dual variational problem over suitable test functions.
• B. Karush–Kuhn–Tucker conditions
  The Karush–Kuhn–Tucker conditions are fundamental optimality criteria in nonlinear programming that generalize Lagrange multipliers to handle inequality constraints.
• C. Slater’s condition
  Slater’s condition is a regularity condition in convex optimization that guarantees strong duality and the validity of the Karush–Kuhn–Tucker optimality conditions by requiring the existence of a strictly feasible point.
• D. Lagrange multipliers
  Lagrange multipliers are a mathematical optimization technique used to find the extrema of functions subject to equality constraints.
• E. Convex Optimization
  Convex Optimization is a widely used graduate-level textbook that systematically develops the theory, algorithms, and applications of convex optimization problems in engineering, statistics, and applied mathematics.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Lagrange duality
Target entity description: Lagrange duality is a fundamental concept in optimization theory that relates a constrained optimization problem to a corresponding dual problem, providing bounds, optimality conditions, and structural insight, especially in convex optimization.

• A. Kantorovich duality
  Kantorovich duality is a fundamental result in optimal transport theory that characterizes the optimal transport cost as the supremum of a dual variational problem over suitable test functions.
• B. Karush–Kuhn–Tucker conditions
  The Karush–Kuhn–Tucker conditions are fundamental optimality criteria in nonlinear programming that generalize Lagrange multipliers to handle inequality constraints.
• C. Slater’s condition
  Slater’s condition is a regularity condition in convex optimization that guarantees strong duality and the validity of the Karush–Kuhn–Tucker optimality conditions by requiring the existence of a strictly feasible point.
• D. Lagrange multipliers
  Lagrange multipliers are a mathematical optimization technique used to find the extrema of functions subject to equality constraints.
• E. Convex Optimization
  Convex Optimization is a widely used graduate-level textbook that systematically develops the theory, algorithms, and applications of convex optimization problems in engineering, statistics, and applied mathematics.
• F. None of above. chosen