A class of nondifferentiable complex programming problems
From MaRDI portal
Cited in
(15)- Optimality conditions for a nondifferentiable minimax programming in complex spaces
- Extension to necessary optimality conditions in complex programming
- Complex minimax programming under generalized convexity
- Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data
- Optimality and duality for complex multi-objective programming
- Optimality and duality for multi-objective fractional programming in complex spaces
- Optimality conditions for nondifferentiable minimax fractional programming with complex variables
- Complex nonlinear programming: Duality with invexity and equivalent real programs
- On nondifferentiable minimax semi-infinite programming problems in complex spaces
- Second-order duality for a non-differentiable minimax programming in complex spaces
- Nondifferentiable Fractional Programming in Complex Space
- Duality for nondifferentiable minimax programming in complex spaces
- Complex minimax programming under generalized type-I functions
- Parametric duality on minimax programming involving generalized convexity in complex space
- Complex minimax fractional programming of analytic functions
This page was built for publication: A class of nondifferentiable complex programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4105517)