Exact quasiconvex conjugation
From MaRDI portal
Publication:3673490
DOI10.1007/BF01916921zbMATH Open0522.90069WikidataQ57836435 ScholiaQ57836435MaRDI QIDQ3673490FDOQ3673490
Publication date: 1983
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
Cites Work
Cited In (18)
- Duality for closed convex functions and evenly convex functions
- A duality approach to minimax results for quasi-saddle functions in finite dimensions
- Conjugaison par tranches
- On \(\Phi\)-convexity of convex functions
- Closed convex sets of Minkowski type
- Lexicographical order and duality in multiobjective programming
- Surrogate duality for vector optimization
- Level sets relaxation, epigraphical relaxation and conditioning in optimization
- Lexicographic choice functions
- Motzkin predecomposable sets
- Classification of semispaces according to their types in infinite-dimensional vector spaces
- Conjugacy in quasi-convex programming
- Support and separation properties of convex sets in finite dimension
- Quasiconvex duality theory by generalized conjugation methods
- Compatible preorders and linear operators on \({\mathbb{R}}^ n\)
- Lexicographical separation in \({\mathbb{R}}^ n\)
- Lexicographical order, lexicographical index, and linear operators
- The structure of hemispaces in \({\mathbb{R}}^ n\)
This page was built for publication: Exact quasiconvex conjugation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3673490)