Nonlinear programming in complex space
From MaRDI portal
Cites work
Cited in
(18)- Nonlinear complex programming
- A class of nondifferentiable mathematical programming problems
- Extension to necessary optimality conditions in complex programming
- Duality for complex programming
- A duality theorem for a special class of programming problems in complex space
- Complex minimax programming under generalized convexity
- Complex nonlinear programming: Duality with invexity and equivalent real programs
- An extension of the transposition theorems of Farkas and Eisenberg
- Existence theory for the complex linear complementarity problem
- Solution of the complex linear complementarity problem
- Sufficiency criteria and duality in complex nonlinear programming involving pseudoinvex function
- On generalized convexity and duality with a square root term
- Duality for generalized problems in complex programming
- Duality in complex homogeneous programming
- Duality in complex homogeneous programming
- Nonlinear programming in complex space
- Complex minimax programming under generalized type-I functions
- Parametric duality on minimax programming involving generalized convexity in complex space
This page was built for publication: Nonlinear programming in complex space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5921384)