Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data
From MaRDI portal
Publication:2032031
DOI10.1007/s10957-021-01829-8zbMath1470.90139OpenAlexW3135285256MaRDI QIDQ2032031
Yibing Lv, Suliman Al-Homidan, Jun Li, Jia-wei Chen, Qamrul Hasan Ansari
Publication date: 15 June 2021
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-021-01829-8
robust counterpartrobust constraint qualificationrobust necessary optimality conditionsuncertain complex fractional programming
Numerical optimization and variational techniques (65K10) Fractional programming (90C32) Robustness in mathematical programming (90C17)
Related Items
Characterizations of multi-objective robustness solutions defined by Minkowski set difference, Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data, Robust nonsmooth optimality conditions for multiobjective optimization problems with infinitely many uncertain constraints, Solving the complex quadratic double-ratio minimax optimization under a quadratic constraint, Unnamed Item, Unified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding
- Robust fractional programming
- Robust duality for fractional programming problems with constraint-wise data uncertainty
- Complex fractional programming and the Charnes-Cooper transformation
- Parametric duality on minimax programming involving generalized convexity in complex space
- Complex minimax fractional programming of analytic functions
- Optimality conditions for a nondifferentiable minimax programming in complex spaces
- Duality for a class of nondifferentiable mathematical programming problems in complex space
- On nonlinear programming in complex spaces
- Robust solutions of linear programming problems contaminated with uncertain data
- Optimality conditions for nondifferentiable minimax fractional programming with complex variables
- Radius of robust feasibility of system of convex inequalities with uncertain data
- Optimality conditions and duality for minimax fractional programming problems with data uncertainty
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Phase recovery, MaxCut and complex semidefinite programming
- Linear programming in complex space
- An extension of the transposition theorems of Farkas and Eisenberg
- Robust Convex Optimization
- Nondifferentiable Fractional Programming in Complex Space
- A class of nondifferentiable complex programming problems
- Nonlinear Complex Programming with Nonlinear Constraints
- Complex Fractional Programming Involving Generalized Quasi/Pseudo Convex Functions
- On Nonlinear Fractional Programming
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
