Duality theory in mathematical programming and optimal control
Jiří V. Outrata, Jiří Jarušek (1984)
Kybernetika
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Nonconvex duality”
Duality theory in mathematical programming and optimal control
Characterizations of ɛ-duality gap statements for constrained optimization problems
Horaţiu-Vasile Boncea, Sorin-Mihai Grad (2013)
Open Mathematics
Similarity:
In this paper we present different regularity conditions that equivalently characterize various ɛ-duality gap statements (with ɛ ≥ 0) for constrained optimization problems and their Lagrange and Fenchel-Lagrange duals in separated locally convex spaces, respectively. These regularity conditions are formulated by using epigraphs and ɛ-subdifferentials. When ɛ = 0 we rediscover recent results on stable strong and total duality and zero duality gap from the literature.
Support separation theorems and their applications to vector surrogate reverse duality
Tran Quoc Chien (1992)
Kybernetika
Similarity:
On the p-drop theorem, 1 ≤ p ≤∞.
Abdelhakim Maaden (2002)
Extracta Mathematicae
Similarity:
Uniformly convex and uniformly smooth convex functions
Dominique Azé, Jean-Paul Penot (1995)
Annales de la Faculté des sciences de Toulouse : Mathématiques
Similarity:
RNP and KMP are incomparable properties in noncomplete spaces.
López, G. (1996)
Acta Mathematica Universitatis Comenianae. New Series
Similarity: