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...

Full description

Bibliographic Details

Published in:	Optimization Vol. 71; no. 14; pp. 4107 - 4123
Main Authors:	Osmanpour, Naser, Keyanpour, Mohammad
Format:	Journal Article
Language:	English
Published:	Philadelphia Taylor & Francis 09.12.2022 Taylor & Francis LLC
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!