Systems of Inequalities Involving Convex Functions
From MaRDI portal
Cited in
(46)- A generalization of a minimax theorem of Fan via a theorem of the alternative
- Inequality systems and minimax theorems
- A continuous-time generalization of Gordan's transposition theorem
- Nonasymptotic necessary conditions for nonsmooth infinite optimization problems
- Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem
- Existence of solutions of pseudo-concave inequalities
- A simplified test for optimality
- Separable utility functions
- Duality and saddle-point type optimality for generalized nonlinear fractional programming.
- A theorem of the alternative with an arbitrary number of inequalities and quadratic programming
- \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
- General equilibrium analysis in ordered topological vector spaces
- Brownian equilibria under Knightian uncertainty
- Theorems of the alternative revisited and some extensions of Yuan's lemma
- Characterizing quasiconvexity of the pointwise infimum of a family of arbitrary translations of quasiconvex functions, with applications to sums and quasiconvex optimization
- The market organism: Long-run survival in markets with heterogeneous traders
- Duality for generalized fractional programs involving n-set functions
- Theorems of the alternative for systems of convex inequalities
- Orbituary: ``Ky Fan (1914--2010), he spent every waking moment thinking about mathematics
- A theorem of the alternative with application to convex programming: optimality, duality, and stability
- The multiplier method of Hestenes and Powell applied to convex programming
- Toward nonquadratic S-lemma: new theory and application in nonconvex optimization
- A new minimax theorem and a perturbed James's theorem
- Duality in Homogeneous Programming
- Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem
- Scalarization methods and expected multi-utility representations
- Fenchel and Lagrange duality are equivalent
- Approximate solutions of interval-valued optimization problems
- An application of semi-infinite linear programming: approximation of a continuous function by a polynomial
- On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
- The Hahn–Banach–Lagrange theorem
- Duality in complex homogeneous programming
- Duality in complex homogeneous programming
- Theorems of the alternative for multivalued mappings and applications to mixed convex \(\backslash\) concave systems of inequalities
- Set valued equilibrium problems without linear structure
- Local stability of solutions to a parametric multi-objective optimal control problem
- Some new minimax theorems for generalized convexity
- Alternative theorem for sequences of functions and applications to optimization
- Bemerkungen zum von Neumannschen Minimaxtheorem
- An extension lemma and homogeneous programming
- Existence theorems and extreme solutions for inequalities concerning convex functions or linear transformations
- On the equilibrium vakue of a system of convex and concave functions
- A geometric Gordan-Stiemke theorem
- Inequality systems and minimax results without linear structure
- Production equilibria
- The regular convex cooperative linear quadratic control problem
This page was built for publication: Systems of Inequalities Involving Convex Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3246368)
