Extension to necessary optimality conditions in complex programming

DOI10.1016/S0096-3003(03)00706-9zbMath1146.90523OpenAlexW2082998168MaRDI QIDQ1827369

Yanyan Li

Publication date: 6 August 2004

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(03)00706-9

zbMATH Keywords

LinearizationConstraint qualificationOptimality conditionsComplex programming problemPointed conePolyhedral cone

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items (3)

Efficiency for a generalized form of vector optimization problems in complex space ⋮ Optimality and duality for complex multi-objective programming ⋮ Criteria of saddle points for the general form of vector optimization problem in complex space

Cites Work

• Unnamed Item
• Unnamed Item
• Real and complex Fritz John theorems
• On solvability of the complex linear complementarity problem
• Duality for a class of nondifferentiable mathematical programming problems in complex space
• On solving complex programs
• Complex nonlinear programming: Duality with invexity and equivalent real programs
• Linear programming in complex space
• Quadratic programming in complex space
• A duality theorem for complex quadratic programming
• Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
• Duality for nonlinear programming in complex space
• Cones, matrices and mathematical programming
• A class of nondifferentiable complex programming problems
• Sufficient optimality conditions for complex programming with quasi-concave constraints
• On Nonlinear Nondifferentiable Complex Programming Problems
• On duality in complex linear programming
• A Fritz John theorem in complex space
• Nonlinear programming in complex space
• Nonlinear programming in complex space

This page was built for publication: Extension to necessary optimality conditions in complex programming