Optimality conditions for a nondifferentiable minimax programming in complex spaces

DOI10.1016/j.na.2008.11.053zbMath1179.90264OpenAlexW2060939271MaRDI QIDQ1026081

Tone-Yau Huang, Hang-Chin Lai

Publication date: 24 June 2009

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.11.053

zbMATH Keywords

convex functioncomplex minimax programmingKuhn-Tucker optimality conditions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Convexity of real functions in one variable, generalizations (26A51)

Related Items (12)

Second-order duality for a non-differentiable minimax programming in complex spaces ⋮ On nondifferentiable minimax semi-infinite programming problems in complex spaces ⋮ Nondifferentiable minimax programming problems with applications ⋮ Duality for nondifferentiable minimax programming in complex spaces ⋮ Nondifferentiable minimax fractional programming in complex spaces with parametric duality ⋮ Optimality and duality for multi-objective fractional programming in complex spaces ⋮ \(E\)-differentiable minimax programming under \(E\)-convexity ⋮ Optimality conditions for nondifferentiable minimax fractional programming with complex variables ⋮ Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications ⋮ Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data ⋮ 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
• Complex fractional programming and the Charnes-Cooper transformation
• Parametric duality on minimax programming involving generalized convexity in complex space
• Complex minimax fractional programming of analytic functions
• Duality for a class of nondifferentiable mathematical programming problems in complex space
• On nonlinear programming in complex spaces
• Nonlinear complex programming
• Necessary conditions and sufficient conditions for static minmax problems
• Optimality conditions for minimax programming of analytic functions
• A duality theorem for a special class of programming problems in complex space
• Linear programming in complex space
• Duality for nonlinear programming in complex space
• An extension of the transposition theorems of Farkas and Eisenberg
• A class of nondifferentiable complex programming problems
• Nonlinear Complex Programming with Nonlinear Constraints
• Complex Fractional Programming Involving Generalized Quasi/Pseudo Convex Functions

This page was built for publication: Optimality conditions for a nondifferentiable minimax programming in complex spaces