Criteria of saddle points for the general form of vector optimization problem in complex space

DOI10.2298/FIL2001221EMaRDI QIDQ5865593zbMATH OpenFDO

Authors Mamdouh E. Elbrolosy

Publication date 9 June 2022

Published in Filomat (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/FIL2001221E

zbMATH Keywords

complex spaceefficient solutionsLagrangiansaddle pointvector optimization

Mathematics Subject Classification ID

Convex functions and convex programs in convex geometry (52A41) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)

Recommendations

• Efficiency for a generalized form of vector optimization problems in complex space
• A saddle-point characterization of Pareto optima
• scientific article; zbMATH DE number 3880459
• Lagrange saddle point criteria for nonsmooth semi-infinite multiobjective optimization problems
• scientific article; zbMATH DE number 2159098

Cites work

• Complex analysis methods related an optimization problem with complex variables
• Efficiency for a generalized form of vector optimization problems in complex space
• Extension to necessary optimality conditions in complex programming
• Extensions of proper efficiency in complex space
• scientific article; zbMATH DE number 3717140 (Why is no real title available?)
• Multi-Objective Programming in Complex Space
• Nonlinear programming in complex space: Sufficient conditions and duality
• On nonlinear programming in complex spaces
• On the Fritz John saddle point problem for differentiable multiobjective optimization
• Saddle point criteria in nonsmooth semi-infinite minimax fractional programming problems
• Saddle point criteria in semi-infinite minimax fractional programming under \((\Phi,\rho)\)-invexity
• Saddle point optimality criteria for mathematical programming problems with equilibrium constraints
• Saddle points for vector valued functions: existence, necessary and sufficient theorems
• Sufficient optimality conditions for semi-infinite multiobjective fractional programming under (\(\Phi,\rho\))-\(V\)-invexity and generalized (\(\Phi,\rho\))-\(V\)-invexity

Cited in

(2)

• Critical points index for vector functions and vector optimization
• A sublinear functional based approximated equivalence to optimality and duality for multiobjective programming in complex spaces

This page was built for publication: Criteria of saddle points for the general form of vector optimization problem in complex space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5865593)