A duality theorem for complex quadratic programming
From MaRDI portal
Publication:2531765
DOI10.1007/BF00927948zbMath0172.43703OpenAlexW2007088838MaRDI QIDQ2531765
Publication date: 1969
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00927948
Related Items
Complex minimax programming under generalized convexity, Stiffness and strength topology optimization for bi‐disc systems based on dual sequential quadratic programming, Linear inequalities, mathematical programming and matrix theory, On the complex complementarity problem, Modified regularity conditions for nonlinear programming problems over mixed cone domains, Duality for generalized problems in complex programming, On nonlinear programming in complex spaces, Quadratic duality over convex cone domains, Nonlinear complex programming, Converse and symmetric duality in complex nonlinear programming, 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, Extension to necessary optimality conditions in complex programming, Nonlinear programming in complex space: Sufficient conditions and duality, Solution of the complex linear complementarity problem, Duality for complex programming, A duality theorem for a special class of programming problems in complex space, Complex minimax programming under generalized type-I functions
Cites Work
