Nonlinear programming in complex space: Sufficient conditions and duality
From MaRDI portal
Publication:2562045
DOI10.1016/0022-247X(72)90073-XzbMATH Open0265.90050OpenAlexW1974198456MaRDI QIDQ2562045FDOQ2562045
Authors: R. A. Abrams 
Publication date: 1972
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(72)90073-x
Quadratic programming (90C20) Linear programming (90C05) Nonlinear programming (90C30) Mathematical programming (90C99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A duality theorem for non-linear programming
- Linear programming in complex space
- Duality for nonlinear programming in complex space
- A DUALITY THEOREM IN NON-LINEAR PROGRAMMING WITH NON-LINEAR CONSTRAINTS1
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- Quadratic programming in complex space
- A duality theorem for complex quadratic programming
Cited In (21)
- Parametric duality on minimax programming involving generalized convexity in complex space
- Second order duality and symmetric duality for nonlinear programs in complex space
- On converse duality in complex nonlinear programming
- On the complex nonlinear complementary problem
- Criteria of saddle points for the general form of vector optimization problem in complex space
- Duality for generalized problems in complex programming
- Sufficiency criteria and duality in complex nonlinear programming involving pseudoinvex function
- A note on Fritz John sufficiency
- 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
- Duality in finite dimensional complex space
- On fractional quadratic optimization problem with two quadratic constraints
- Complex minimax programming under generalized convexity
- Modulus-based matrix splitting methods for complex linear complementarity problem
- A Fritz John type sufficient optimality theorem in complex space
- Sufficient Fritz John optimality conditions
- Complex nonlinear programming: Duality with invexity and equivalent real programs
- Optimality and duality for complex multi-objective programming
- Solution of the complex linear complementarity problem
- Linear inequalities, mathematical programming and matrix theory
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)
