Nonlinear programming in complex space: Sufficient conditions and duality
From MaRDI portal
Publication:2562045
Cites work
- A duality theorem for complex quadratic programming
- A duality theorem for non-linear programming
- A DUALITY THEOREM IN NON-LINEAR PROGRAMMING WITH NON-LINEAR CONSTRAINTS1
- Duality for nonlinear programming in complex space
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- scientific article; zbMATH DE number 3062447 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- Linear programming in complex space
- Quadratic programming in complex space
Cited in
(22)- 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
- On fractional quadratic optimization problem with two quadratic constraints
- Optimality and duality for complex multi-objective programming
- 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
- 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
- Criteria of saddle points for the general form of vector optimization problem in complex space
- Modulus-based matrix splitting methods for complex linear complementarity problem
- Complex chance-constrained optimization under Wasserstein ball
- Complex minimax programming under generalized type-I functions
- Parametric duality on minimax programming involving generalized convexity in complex space
This page was built for publication: Nonlinear programming in complex space: Sufficient conditions and duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2562045)