Abstract Let f (x)= x^ TAx+ 2a^ Tx+ cf (x)= x TA x+ 2 a T x+ c and h (x)= x^ TBx+ 2b^ Tx+ dh
(x)= x TB x+ 2 b T x+ d be two quadratic functions having symmetric matrices AA and B B …

A Survey of Hidden Convex Optimization | SpringerLink Skip to main content Advertisement
SpringerLink Log in Menu Find a journal Publish with us Search Cart 1.Home 2.Journal of the …

This bibliography of fractional programming is a continuation of eight previous
bibliographies by the author (Pure Appl. Math. Sci.(India), Vol. XIII, No. 1–2, 35–69, March …

We study the problem, which we refer to as problem (P), of maximizing the sum of a
generalized Rayleigh quotient and a quadratic form on the unit sphere. The computational …

The mixed-integer quadratically constrained quadratic fractional programming (MIQCQFP)
problem often appears in various fields such as engineering practice, management science …

Abstract We extend the Calabi-Polyak theorem on the convexity of joint numerical range
from three to any number of matrices on condition that each of them is a linear combination …

This paper first proposes a new and enhanced second order cone programming relaxation
using the simultaneous matrix diagonalization technique for the linearly constrained …

In this paper, we study a class of nonsmooth fractional programs {\rm (FP, for short)} with
SOS-convex semi-algebraic functions. Under suitable assumptions, we derive a strong …

本文研究了一类带有广义多项式约束的广义分式规划问题. 首先将原问题转化为其等价形式,
然后利用特殊不等式的有关性质将等价问题转化为易于求解的几何规划问题(GP) …

The problem of minimizing the sum of a convex quadratic function and the ratio of two
quadratic functions can be reformulated as a Celis–Dennis–Tapia (CDT) problem and, thus …