Exact quasiconvex conjugation

DOI10.1007/BF01916921zbMath0522.90069WikidataQ57836435 ScholiaQ57836435MaRDI QIDQ3673490

Juan-Enrique Martinez-Legaz

Publication date: 1983

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

zbMATH Keywords

duality gapdual problemsvertical perturbationsconjugacy theoryquasiconvex analysis

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

Lexicographical order and duality in multiobjective programming, The structure of hemispaces in \({\mathbb{R}}^ n\), Surrogate duality for vector optimization, Level sets relaxation, epigraphical relaxation and conditioning in optimization, Lexicographic choice functions, Lexicographical order, lexicographical index, and linear operators, Motzkin predecomposable sets, Quasiconvex duality theory by generalized conjugation methods, A duality approach to minimax results for quasi-saddle functions in finite dimensions, Conjugacy in quasi-convex programming, Closed convex sets of Minkowski type, Support and separation properties of convex sets in finite dimension, Lexicographical separation in \({\mathbb{R}}^ n\), Classification of semispaces according to their types in infinite-dimensional vector spaces, On \(\Phi\)-convexity of convex functions, Compatible preorders and linear operators on \({\mathbb{R}}^ n\), Conjugaison par tranches, Duality for closed convex functions and evenly convex functions

Cites Work

• On $\Phi $-Convexity in Extremal Problems
• Quasi-Convex Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item