Convex analysis treated by linear programming
From MaRDI portal
Cites work
- An Infinite Linear Program with a Duality Gap
- An orthogonality theorem of dines related to moment problems and linear programming
- Classifying convex extremum problems over linear topologies having separation properties
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- scientific article; zbMATH DE number 3121286 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- scientific article; zbMATH DE number 3383753 (Why is no real title available?)
- Linear Programming in Reflexive Spaces
- Linearizing Geometric Programs
- Programmes in Paired Spaces
- Symmetric Duality for Generalized Unconstrained Geometric Programming
Cited in
(19)- In a semi-infinite program only a countable subset of the constraints is essential
- An additive eigenvalue problem of physics related to linear programming
- Linear inequalities in mathematical programming and pattern recognition
- The limiting Lagrangian as a consequence of Helly's theorem
- A limiting Lagrangian for infinitely-constrained convex optimization in \(\mathbb{R}^n\)
- A limiting infisup theorem
- Perfect duality for convexlike programs
- A pathological semi-infinite program verifying Karlovitz's conjecture
- Constructing a perfect duality in infinite programming
- On duality in semi-infinite programming and existence theorems for linear inequalities
- Classifying convex extremum problems over linear topologies having separation properties
- Strong duality for standard convex programs
- Duality for convex infinite optimization on linear spaces
- Perfect duality in solving geometric programming problems under uncertainty
- A simplified conjugation scheme for lower semi-continuous functions
- A note on perfect duality and limiting lagrangeans
- On a classification scheme for geometric programming and complementarity theorems††
- Convex optimization and lagrange multipliers
- Limiting Lagrangians: A primal approach
This page was built for publication: Convex analysis treated by linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5675150)
