A Relaxed and Bound Algorithm Based on Auxiliary Variables for Quadratically Constrained Quadratic Programming Problem

Quadratically constrained quadratic programs (QCQP), which often appear in engineering practice and management science, and other fields, are investigated in this paper. By introducing appropriate auxiliary variables, QCQP can be transformed into its equivalent problem (EP) with non-linear equality constraints. After these equality constraints are relaxed, a series of linear relaxation subproblems with auxiliary variables and bound constraints are generated, which can determine the effective lower bound of the global optimal value of QCQP. To enhance the compactness of sub-rectangles and improve the ability to remove sub-rectangles, two rectangle-reduction strategies are employed. Besides, two ϵ-subproblem deletion rules are introduced to improve the convergence speed of the algorithm. Therefore, a relaxation and bound algorithm based on auxiliary variables are proposed to solve QCQP. Numerical experiments show that this algorithm is effective and feasible.

UNIFORM INFERENCE IN A GENERALIZED INTERVAL ARITHMETIC CENTER AND RANGE LINEAR MODEL

Via generalized interval arithmetic, we propose a Generalized Interval Arithmetic Center and Range (GIA-CR) model for random intervals, where parameters in the model satisfy linear inequality constraints. We construct a constrained estimator of the parameter vector and develop asymptotically uniformly valid tests for linear equality constraints on the parameters in the model. We conduct a simulation study to examine the finite sample performance of our estimator and tests. Furthermore, we propose a coefficient of determination for the GIA-CR model. As a separate contribution, we establish the asymptotic distribution of the constrained estimator in Blanco-Fernández (2015, Multiple Set Arithmetic-Based Linear Regression Models for Interval-Valued Variables) in which the parameters satisfy an increasing number of random inequality constraints.

On the minimum-norm solution of convex quadratic programming

We discuss some basic concepts and present a numerical procedure for finding the minimum-norm solution of convex quadratic programs (QPs) subject to linear equality and inequality constraints. Our approach is based on a theorem of alternatives and on a convenient characterization of the solution set of convex QPs. We show that this problem can be reduced to a simple constrained minimization problem with a once-differentiable convex objective function. We use finite termination of an appropriate Newton's method to solve this problem. Numerical results show that the proposed method is efficient.