Pages that link to "Item:Q2531765"
From MaRDI portal
The following pages link to A duality theorem for complex quadratic programming (Q2531765):
Displaying 19 items.
- Complex minimax programming under generalized type-I functions (Q814060) (← links)
- On nonlinear programming in complex spaces (Q1193168) (← links)
- Nonlinear complex programming (Q1211419) (← links)
- Converse and symmetric duality in complex nonlinear programming (Q1214852) (← links)
- Extension to necessary optimality conditions in complex programming (Q1827369) (← links)
- Duality for complex programming (Q1843374) (← links)
- A duality theorem for a special class of programming problems in complex space (Q1844590) (← links)
- Complex minimax programming under generalized convexity (Q1877126) (← links)
- Complex nonlinear programming: Duality with invexity and equivalent real programs (Q2277371) (← links)
- An extension of the transposition theorems of Farkas and Eisenberg (Q2543640) (← links)
- Existence theory for the complex linear complementarity problem (Q2545665) (← links)
- Nonlinear programming in complex space: Sufficient conditions and duality (Q2562045) (← links)
- Solution of the complex linear complementarity problem (Q2562753) (← links)
- On the complex complementarity problem (Q4047404) (← links)
- Modified regularity conditions for nonlinear programming problems over mixed cone domains (Q4055388) (← links)
- Duality for generalized problems in complex programming (Q4099425) (← links)
- Quadratic duality over convex cone domains (Q4108152) (← links)
- Linear inequalities, mathematical programming and matrix theory (Q5663632) (← links)
- Stiffness and strength topology optimization for bi‐disc systems based on dual sequential quadratic programming (Q6090785) (← links)
