Transposition Theorems for Cone-Convex Functions
From MaRDI portal
Cited in
(15)- A continuous-time generalization of Gordan's transposition theorem
- Minimax principles for convex eigenvalue problems
- Duality for generalized fractional programs involving n-set functions
- KKT conditions for weak\(^\ast\) compact convex sets, theorems of the alternative, and optimality conditions
- A duality theorem for a nondifferentiable nonlinear fractional programming problem
- A necessary and sufficient condition for duality in control problems: KT-invex functionals
- Complete characterization of optimality for convex programming in banach spaces†
- Various definitions of the derivative in mathematical programming
- Sufficient Fritz John optimality conditions
- Lagrangean conditions and quasiduality
- A transposition theorem with applications to constrained optimal control problems
- Some new minimax theorems for generalized convexity
- Alternative theorem for sequences of functions and applications to optimization
- Real and complex Fritz John theorems
- FJ-invex control problem
This page was built for publication: Transposition Theorems for Cone-Convex Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5645654)