In this paper, we study a class of biquadratic optimization problems. We first relax the original problem to its semidefinite programming (SDP) problem and discuss the approximation ratio between them. Under some conditions, we show that the relaxed problem is tight. Then we consider how to...

In this paper we develop probabilistic arguments for justifying thequality of an approximate solution for global quadratic minimization problem, obtained as a best point among all points of a uniform grid inside a polyhedral feasible set. Our main tool is a random walk inside the standard...

Sharpe style regression has become a widespread analytic tool in the financial community. The style regression allows one to investigate such interesting issues as style composition, style sensitivity, and style change over time. All previous methods to obtain the distribution and confidence...

In this paper we present sufficient conditions for global optimality of non-convex quadratic programs involving linear matrix inequality (LMI) constraints. Our approach makes use of the concept of a quadratic subgradient. We develop optimality conditions for quadratic programs with LMI...