Duality in Nonconvex Optimization and Calculus of Variations.

Abstract

A general duality theory is given for smooth nonconvex optimization problems, covering both the finite-dimensional case and the calculus of variations. The results are quite similar to the convex case; in particular, with every problem (P) is associated a dual problem (P*) having opposite value.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1976
Accession Number
ADA031953

Entities

People

  • Ivar Ekeland

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Algebraic Geometry
  • Boundary Value Problems
  • Calculus
  • Calculus Of Variations
  • Computational Fluid Dynamics
  • Computational Science
  • Differential Equations
  • Eigenvalues
  • Equations
  • Euler Equations
  • Geometry
  • Mathematical Programming
  • Mathematics
  • Notation
  • Operations Research
  • Optimization
  • Topology

Readers

  • Graph Algorithms and Convex Optimization.
  • Phased Array Antenna Design.

Technology Areas

  • AI & ML
  • AI & ML - Machine Learning Algorithms