Duality for nondifferentiable minimax programming in complex spaces
DOI10.1016/J.NA.2008.10.062zbMATH Open1238.90135OpenAlexW1977475145MaRDI QIDQ419745FDOQ419745
Authors: Hang-Chin Lai, Jen-chwan Liu 
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
Recommendations
- Duality for a class of nondifferentiable mathematical programming problems in complex space
- Nondifferentiable minimax fractional programming in complex spaces with parametric duality
- Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions
- Second-order duality for a non-differentiable minimax programming in complex spaces
- On nondifferentiable minimax semi-infinite programming problems in complex spaces
Optimality conditions and duality in mathematical programming (90C46) Minimax problems in mathematical programming (90C47) Convexity of real functions of several variables, generalizations (26B25)
Cites Work
- Optimality conditions for a nondifferentiable minimax programming in complex spaces
- Duality for a class of nondifferentiable mathematical programming problems in complex space
- Complex nonlinear programming: Duality with invexity and equivalent real programs
- Linear programming in complex space
- An extension of the transposition theorems of Farkas and Eisenberg
- A class of nondifferentiable complex programming problems
- Necessary conditions and sufficient conditions for static minmax problems
- Nonlinear complex programming
- A duality theorem for a special class of programming problems in complex space
- Duality for nonlinear programming in complex space
- Title not available (Why is that?)
- Supports of a convex function
- Complex Fractional Programming Involving Generalized Quasi/Pseudo Convex Functions
- A Gradient Inequality for a Class of Nondifferentiable Functions
- 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
Cited In (19)
- Nondifferentiable Fractional Programming in Complex Space
- Title not available (Why is that?)
- Mixed-Type Duality on Nonsmooth Minimax Fractional Programming Involving Exponential (p, r)-Invexity
- Duality results for nonlinear single minimax location problems via multi-composed optimization
- Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions
- Parametric duality on minimax programming involving generalized convexity in complex space
- Complex analysis methods related an optimization problem with complex variables
- On nondifferentiable minimax semi-infinite programming problems in complex spaces
- Order generalised gradient and operator inequalities
- Optimality conditions for a nondifferentiable minimax programming in complex spaces
- Nondifferentiable minimax fractional programming in complex spaces with parametric duality
- Duality for a class of nondifferentiable mathematical programming problems in complex space
- Second-order duality for a non-differentiable minimax programming in complex spaces
- Optimality and duality for nonsmooth multiobjective fractional programming problems involving exponential \(V\)-\(r\)-invexity
- Mixed type duality for a nondifferentiable minimax fractional complex programming
- Title not available (Why is that?)
- A subgradient duality theorem in complex space
- Optimality conditions for nondifferentiable minimax fractional programming with complex variables
- Optimality and duality for complex multi-objective programming
This page was built for publication: Duality for nondifferentiable minimax programming in complex spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q419745)
