In this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. First we introduce a parametric equivalent of the problem. Then a bisection and a generalized Newton-based method algorithms are presented to solve it. In order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...

The aim of this article is to show a simple way to construct asymptotic minimax lower bounds for risks based on different types of quadratic loss functions in semiparametric inference problems. For the sake of clarity, we consider the simple case of the state estimation of a dynamical system with small noise. The proofs are based on the van Trees inequality, namely, an integral-type Cramér-Rao ...

The paper deals with a short presentation of the basic ideas concerning the multiparametric quadratic programming (mp-QP) problems. The model predictive control is considered also as particular mp-QP problem. Since the solutions to mp-QP problems can be expressed as piecewise affine linear functions of the state, a new implementation in terms of adaptive network-based fuzzy inference systems is...

The aim of this paper is to show a simple way to construct asymptotic minimax lower bounds for risks based on different types of quadratic loss functions in semiparametric inference problems. For the sake of clarity, we consider the simple case of the state estimation of a dynamical system with small noise. The proofs are based on the van Trees inequality, namely an integral type Cramér-Rao ine...

In this paper, we first introduce the notion of $c$-affine functions for $c> 0$. Then we deal with some properties of strongly convex functions in real inner product spaces by using a quadratic support function at each point which is $c$-affine. Moreover, a Hyers–-Ulam stability result for strongly convex functions is shown.

multi objective quadratic fractional programming (moqfp) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the object...