Duality for nondifferentiable minimax programming in complex spaces
From MaRDI portal
Publication:419745
DOI10.1016/j.na.2008.10.062zbMath1238.90135OpenAlexW1977475145MaRDI QIDQ419745
Publication date: 20 May 2012
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2008.10.062
Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46) Convexity of real functions of several variables, generalizations (26B25)
Related Items (7)
Mixed-Type Duality on Nonsmooth Minimax Fractional Programming Involving Exponential (p, r)-Invexity ⋮ Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions ⋮ Nondifferentiable minimax fractional programming in complex spaces with parametric duality ⋮ Order generalised gradient and operator inequalities ⋮ Optimality conditions for nondifferentiable minimax fractional programming with complex variables ⋮ Optimality and duality for nonsmooth multiobjective fractional programming problems involving exponential \(V\)-\(r\)-invexity ⋮ Optimality and duality for complex multi-objective programming
Cites Work
- Unnamed Item
- Nondifferentiable fractional programming in complex spaces involving \(({\mathfrak L},\varrho,\theta)\)-convex analytic functions
- Parametric duality on minimax programming involving generalized convexity in complex space
- Complex minimax fractional programming of analytic functions
- Optimality conditions for a nondifferentiable minimax programming in complex spaces
- Duality for a class of nondifferentiable mathematical programming problems in complex space
- Nonlinear complex programming
- Necessary conditions and sufficient conditions for static minmax problems
- A duality theorem for a special class of programming problems in complex space
- Complex nonlinear programming: Duality with invexity and equivalent real programs
- Linear programming in complex space
- Duality for nonlinear programming in complex space
- An extension of the transposition theorems of Farkas and Eisenberg
- Supports of a convex function
- A class of nondifferentiable complex programming problems
- Complex Fractional Programming Involving Generalized Quasi/Pseudo Convex Functions
- A Gradient Inequality for a Class of Nondifferentiable Functions
This page was built for publication: Duality for nondifferentiable minimax programming in complex spaces
