Duality theorems for convex and quasiconvex set functions
From MaRDI portal
Publication:2225642
This article examines duality in convex and quasiconvex mathematical programming. The first two sections present the necessary background definitions and notations, followed by an examination of Lagrange duality for convex set functions. The fourth section moves on to study surrogate duality involving convex and quasiconvex set functions. The article concludes with a section of potential applications of the main results presented in this work.
Recommendations
Cites work
- A constraint qualification characterizing surrogate duality for quasiconvex programming
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications
- Conjugate duality in convex optimization
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Convex programming with set functions
- Convolution of set functions
- Duality in robust optimization: Primal worst equals dual best
- Duality theorems for separable convex programming without qualifications
- Epigraphs of convex set functions
- Fenchel duality for convex set functions
- Generalized concavity
- Generalized convex set functions
- Generators and constraint qualifications for quasiconvex inequality systems
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 1018428 (Why is no real title available?)
- scientific article; zbMATH DE number 3435272 (Why is no real title available?)
- Moreau-Rockafellar type theorem for convex set functions
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming
- Necessary and sufficient constraint qualification for surrogate duality
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- Nonlinear Programming
- On set containment characterization and constraint qualification for quasiconvex programming
- On several results about convex set functions
- On the optimality of differentiable nonconvex n-set functions
- Optimal constrained selection of a measurable subset
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- Quasi-Convex Programming
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Robust Farkas' lemma for uncertain linear systems with applications
- Some constraint qualifications for quasiconvex vector-valued systems
- Strong duality in robust convex programming: complete characterizations
- Strong duality in robust semi-definite linear programming under data uncertainty
- Surrogate duality for robust optimization
- Surrogate Mathematical Programming
- The Fenchel-Moreau Theorem for Set Functions
- The Generalized Penalty-Function/Surrogate Model
Cited in
(10)- Dual characterizations of set containments with strict convex inequalities
- Asymptotic duality over closed convex sets
- Symbolic computation of multidimensional Fenchel conjugates
- A convex-like duality scheme for quasi-convex programs
- Duality for the level sum of quasiconvex functions and applications
- scientific article; zbMATH DE number 592634 (Why is no real title available?)
- scientific article; zbMATH DE number 1822202 (Why is no real title available?)
- scientific article; zbMATH DE number 5206490 (Why is no real title available?)
- scientific article; zbMATH DE number 2226571 (Why is no real title available?)
- Duality between quasi-concave functions and monotone linkage functions
This page was built for publication: Duality theorems for convex and quasiconvex set functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225642)
