A duality theorem for complex quadratic programming
From MaRDI portal
Cites work
Cited in
(19)- Linear inequalities, mathematical programming and matrix theory
- Modified regularity conditions for nonlinear programming problems over mixed cone domains
- Quadratic duality over convex cone domains
- Nonlinear complex programming
- On the complex complementarity problem
- Duality for generalized problems in complex programming
- A duality theorem for a special class of programming problems in complex space
- Complex minimax programming under generalized type-I functions
- On nonlinear programming in complex spaces
- Converse and symmetric duality in complex nonlinear programming
- Stiffness and strength topology optimization for bi‐disc systems based on dual sequential quadratic programming
- Complex minimax programming under generalized convexity
- Nonlinear programming in complex space: Sufficient conditions and duality
- Extension to necessary optimality conditions in complex programming
- Existence theory for the complex linear complementarity problem
- Complex nonlinear programming: Duality with invexity and equivalent real programs
- Duality for complex programming
- Solution of the complex linear complementarity problem
- An extension of the transposition theorems of Farkas and Eisenberg
This page was built for publication: A duality theorem for complex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2531765)
