An abstract symmetric framework for duality in mathematical programming
From MaRDI portal
Publication:3835637
Recommendations
Cites work
- scientific article; zbMATH DE number 3827624 (Why is no real title available?)
- scientific article; zbMATH DE number 3961298 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 3564722 (Why is no real title available?)
- scientific article; zbMATH DE number 3358265 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- A duality principle for non-convex optimisation and the calculus of variations
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
- Abstract study of optimality conditions
- An elementary survey of general duality theory in mathematical programming
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- Convex Analysis
- Dualities between complete lattices
- Duality in nonconvex optimization
- On $\Phi $-Convexity in Extremal Problems
- On Conjugate Convex Functions
- Quasiconvex duality theory by generalized conjugation methods
- Tangency and differentiation: Marginal functions
Cited in
(2)
This page was built for publication: An abstract symmetric framework for duality in mathematical programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3835637)