Complex analysis methods related an optimization problem with complex variables

zbMATH Open1216.90089MaRDI QIDQ5393197FDOQ5393197

Authors: Hang-Chin Lai, Tone-Yau Huang 

Publication date: 15 April 2011

Recommendations

• Optimality conditions for nondifferentiable minimax fractional programming with complex variables
• Duality for nondifferentiable minimax programming in complex spaces
• Nondifferentiable minimax fractional programming in complex spaces with parametric duality
• Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions
• Duality for a class of nondifferentiable mathematical programming problems in complex space

zbMATH Keywords

generalized convexitycomplex minimax fractional programmingduality problems

Mathematics Subject Classification ID

Fractional programming (90C32) Optimality conditions and duality in mathematical programming (90C46) Minimax problems in mathematical programming (90C47)

Cited In (6)

• Nondifferentiable fractional programming in complex spaces involving \(({\mathfrak L},\varrho,\theta)\)-convex analytic functions
• Criteria of saddle points for the general form of vector optimization problem in complex space
• Complex and quaternionic optimization
• Title not available (Why is that?)
• Unconstrained Optimization of Real Functions in Complex Variables
• Analytic Functions Optimizing Competing Constraints

This page was built for publication: Complex analysis methods related an optimization problem with complex variables

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