An abstract symmetric framework for duality in mathematical programming

DOI10.1080/02331939408843919zbMath0819.90128OpenAlexW2070001495MaRDI QIDQ3835637

No author found.

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939408843919

zbMATH Keywords

environmentdual programsassociated Lagrangean

Mathematics Subject Classification ID

Existence of solutions for minimax problems (49J35) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Abstract study of optimality conditions
• Tangency and differentiation: Marginal functions
• Duality in nonconvex optimization
• A duality principle for non-convex optimisation and the calculus of variations
• Dualities between complete lattices
• A primal-dual algorithm for the fermat-weber problem involving mixed gauges
• Quasiconvex duality theory by generalized conjugation methods
• An elementary survey of general duality theory in mathematical programming
• On $\Phi $-Convexity in Extremal Problems
• Convex Analysis
• Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
• On Conjugate Convex Functions

This page was built for publication: An abstract symmetric framework for duality in mathematical programming