A hybrid method for solving non-convex min-max quadratic fractional problems under quadratic constraints

In this paper, we study a non-convex min-max fractional problem of quadratic functions subject to convex and non-convex quadratic constraints. First, by using the Dinkelbach-type method, we transform the fractional problem into a univariate nonlinear equation. To evaluate this equation, we need to s...

Celý popis

Podrobná bibliografia

Vydané v:	Optimization Ročník 71; číslo 14; s. 4107 - 4123
Hlavní autori:	Osmanpour, Naser, Keyanpour, Mohammad
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia Taylor & Francis 09.12.2022 Taylor & Francis LLC
Predmet:	Constraints convex-concave procedure Dinkelbach-type method Iterative methods Lower bounds min-max fractional programming non-convex constraint Nonlinear equations Quadratic equations Quadratic programming Upper bounds
ISSN:	0233-1934, 1029-4945
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!