Nonlinear programming in complex space: Sufficient conditions and duality
From MaRDI portal
Publication:2562045
DOI10.1016/0022-247X(72)90073-XzbMath0265.90050MaRDI QIDQ2562045
Publication date: 1972
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
90C30: Nonlinear programming
90C20: Quadratic programming
90C05: Linear programming
90C99: Mathematical programming
Related Items
A Fritz John type sufficient optimality theorem in complex space, Linear inequalities, mathematical programming and matrix theory, Second order duality and symmetric duality for nonlinear programs in complex space, Complex minimax programming under generalized type-I functions, Parametric duality on minimax programming involving generalized convexity in complex space, On nonlinear programming in complex spaces, 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, Solution of the complex linear complementarity problem, Sufficiency criteria and duality in complex nonlinear programming involving pseudoinvex function, On converse duality in complex nonlinear programming, Sufficient Fritz John optimality conditions, On the complex nonlinear complementary problem, Duality for generalized problems in complex programming, A note on Fritz John sufficiency, Duality in finite dimensional complex space
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear programming in complex space
- Quadratic programming in complex space
- A duality theorem for complex quadratic programming
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- Duality for nonlinear programming in complex space
- A DUALITY THEOREM IN NON-LINEAR PROGRAMMING WITH NON-LINEAR CONSTRAINTS1
- A duality theorem for non-linear programming