Complete solutions to nonconvex fractional programming problems

arXiv1211.4664MaRDI QIDQ6237330FDOQ6237330

Publication date: 19 November 2012

Abstract: This paper presents a canonical dual approach to the problem of minimizing the sum of a quadratic function and the ratio of nonconvex function and quadratic functions, which is a type of non-convex optimization problem subject to an elliptic constraint. We first relax the fractional structure by introducing a family of parametric subproblems. Under certain conditions, we show that the canonical dual of each subproblem becomes a two-dimensional concave maximization problem that exhibits no duality gap. Since the infimum of the optima of the parameterized subproblems leads to a solution to the original problem, we then derive some optimality conditions and existence conditions for finding a global minimizer of the original problem.

This page was built for publication: Complete solutions to nonconvex fractional programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6237330)