This report considers a discrete fractional quadratic optimization problem motivated by a recent application in blind maximum-likelihood (ML) detection of higher-order QAM orthogonal spacetime block codes (OSTBCs) in wireless multiple-input multiple-output (MIMO) communications. Since this discrete fractional quadratic optimization problem is NP-hard in general, we present a suboptimal approach...

Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of pro...

Bilevel programs are optimization problems which have a subset of their variables constrained to be an optimal solution of another problem parameterized by the remaining variables. They have been applied to decentralized planning problems involving a decision process with a hierarchical structure. This paper considers the linear fractional/quadratic bilevel programming (LFQBP) problem, in which...

9 This article proposes an approach to handle multi-attribute decision making (MADM) 10 problems under the interval-valued intuitionistic fuzzy environment, in which both 11 assessments of alternatives on attributes (hereafter, referred to as attribute values) and 12 attribute weights are provided as interval-valued intuitionistic fuzzy numbers (IVIFNs). 13 The notion of relative closeness is e...

This paper examines a complex fractional quadratic optimization problem subject to two constraints. The original is transformed into parametric programming by the well-known classical Dinkelbach method. Then semidefinite and Lagrangian dual approaches are presented solve nonconvex at each iteration of bisection generalized Newton algorithms. Finally, numerical results demonstrate effectiveness ...

In this paper, we focus on fractional programming problems that minimize the ratio of two indefinite quadratic functions subject to two quadratic constraints. Utilizing the relationship between fractional programming and parametric programming, we transform the original problem into a univariate nonlinear equation. To evaluate the function in the equation, we need to solve a problem of minimizi...

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

We introduce a system combining the quadratic self-attractive or composite quadratic-cubic nonlinearity, acting in combination with fractional diffraction, which is characterized by its Lévy index ?. The model applies to gas of quantum particles moving flights, term representing Lee-Huang-Yang correction mean-field interactions. A family fundamental solitons constructed numerical form, while de...