Complex Fractional Programming Involving Generalized Quasi/Pseudo Convex Functions
The authors consider the following nondifferentiable complex fractional programming \[ \text{minimize }\frac {\text{Re} \bigl[ f(z, \overline z)+ (z^HAz)^{1/2} \bigr]} {\text{Re}\bigl[ g(z,\overline z)-(z^HBz)^{1/2}\bigr]} \text{ subject to } h(z,\overline z)\in S\in \mathbb{C}^m,\;z\in\mathbb{C}^n,\tag{P} \] where \(f,g: \mathbb{C}^{2n}\to C\) and \(h: \mathbb{C}^{2n}\to\mathbb{C}^m\) are analytic functions on \(Q=\{ (z,w)\in \mathbb{C}^{2n} \mid w=\overline z\}\), \(A,B\in\mathbb{C}^{2n}\) are positive semidefinite Hermitian matrices; \(S\) is a polyhedral cone in \(\mathbb{C}^m\). It is assumed that \(\text{Re}\,F(z,\overline z)\geq 0\) and \(\text{Re} \,G(z,\overline z)>0\) for all feasible points \((z;\overline z)\) of (P). They establish conditions for the existence of an optimal solution in (P) involving \(({\mathcal L}, \rho,\theta)\)-quasiconvex/-pseudoconvex functions. Based on the suffiency, a dual model to (P) is formulated, and weak, strong, and strictly converse duality theorems are established.
- Nondifferentiable fractional programming in complex spaces involving \(({\mathfrak L},\varrho,\theta)\)-convex analytic functions
- scientific article; zbMATH DE number 3877862
- Nondifferentiable Fractional Programming in Complex Space
- Duality for fractional complex programming with generalized convexity
- Complex minimax fractional programming of analytic functions
- Optimality conditions for a nondifferentiable minimax programming in complex spaces
- On the complex fractional quadratic optimization with a quadratic constraint
- Parameter-free dual models for fractional programming with generalized invexity
- Complex minimax programming under generalized convexity
- Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data
- Optimality conditions for nondifferentiable minimax fractional programming with complex variables
- Duality for fractional complex programming with generalized convexity
- A Locally Convex Extremal Problem over Some Family of Complex Functions
- Nondifferentiable Fractional Programming in Complex Space
- scientific article; zbMATH DE number 3856832 (Why is no real title available?)
- A sixth bibliography of fractional programming
- Duality for nondifferentiable minimax programming in complex spaces
- Nondifferentiable minimax fractional programming in complex spaces with parametric duality
- Minimizing a complex quadratic fractional optimization problem with two second-order cone constraints
- On the efficiency of the algorithm for solving complex quadratic double-ratio minimax optimization problem
- Nondifferentiable fractional programming in complex spaces involving \(({\mathfrak L},\varrho,\theta)\)-convex analytic functions
- Optimality and duality for nonsmooth multiobjective fractional programming problems involving exponential V-r-invexity
- Complex fractional programming and the Charnes-Cooper transformation
- Complex minimax programming under generalized type-I functions
- Parametric duality on minimax programming involving generalized convexity in complex space
- Complex minimax fractional programming of analytic functions
This page was built for publication: Complex Fractional Programming Involving Generalized Quasi/Pseudo Convex Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537546)
