Solving the complex quadratic double-ratio minimax optimization under a quadratic constraint
From MaRDI portal
Publication:2700113
DOI10.1007/s12190-022-01762-7OpenAlexW4283118873MaRDI QIDQ2700113
Publication date: 20 April 2023
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-022-01762-7
minimax optimizationglobal optimizationquadratic programmingsemidefinite programmingfractional programming
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Fractional programming (90C32)
Uses Software
Cites Work
- Nondifferentiable minimax fractional programming in complex spaces with parametric duality
- An algorithm for generalized fractional programs
- Second order duality for minmax fractional programming
- A note on an algorithm for generalized fractional programs
- Duality for a class of nondifferentiable mathematical programming problems in complex space
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- On minimax fractional optimality and duality with generalized convexity
- Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data
- Quadratic double-ratio minimax optimization
- Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity
- Lectures on Modern Convex Optimization
- Cooperative Strategies and Capacity Theorems for Relay Networks
- Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior
- Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
- Optimization of MIMO Relays for Multipoint-to-Multipoint Communications: Nonrobust and Robust Designs
- Minimax Theorems
- Unnamed Item
- Unnamed Item
This page was built for publication: Solving the complex quadratic double-ratio minimax optimization under a quadratic constraint
