On a Quadratic Optimization Problem with Equality Constraints

The constrained optimization problem with a quadratic cost functional and two quadratic equality constraints has been studied by Bar-on and Grasse, with positive-definite matrix in the objective. In this note, we shall relax the matrix in the objective to be positive semidefinite. A necessary and sufficient condition to characterize a local optimal solution to be global is established. Also, a perturbation scheme is proposed to solve this generalized problem.     

An improved linearization strategy for zero-one quadratic programming problems

We present a new linearized model for the zero-one quadratic programming problem, whose size is linear in terms of the number of variables in the original nonlinear problem. Our derivation yields three alternative reformulations, each varying in model size and tightness. We show that our models are at least as tight as the one recently proposed in [7], and examine the theoretical relationship of our models to a standard linearization of the zero-one quadratic programming problem. Finally, we demonstrate the efficacy of solving each of these models on a set of randomly generated test instances.     

Some proximity and sensitivity results in quadratic integer programming

We show that for any optimal solution for a given separable quadratic integer programming problem there exist an optimal solution for its continuous relaxation such that wheren is the number of variables and(A) is the largest absolute subdeterminant of the integer constraint matrixA. Also for any feasible solutionz, which is not optimal for the separable quadratic integer programming problem, there exists a feasible solution having greater objective function value and with . We further prove, under some additional assumptions, that the distance between a pair of optimal solutions to an integer quadratic programming problem with right hand side vectorsb andb, respectively, depends linearly on b–b₁. Finally the validity of all the results for nonseparable mixed-integer quadratic programs is established. The proximity results obtained in this paper are extensions of some of the results described in Cook et al. (1986) for linear integer programming.This research was partially supported by Natural Sciences and Engineering Research Council of Canada Grant 5-83998.     

Ab initio calculations of vibronic activity in phosphorescence microwave double resonance spectra of p-dichlorobenzene

The phosphorescence spectrum of p-dichlorobenzene has been calculated using multiconfiguration self-consistent-field wave functions and the quadratic response technique. Attention has been paid to the intensity distribution of the singlet–triplet (³B_1u¹A_g) transition through a number of vibronic subbands. The second order spin–orbit coupling (SOC) contribution to the spin splitting of the ³B_1u (^3*) state is found to be almost negligible, and the calculations therefore provide a good estimate for the zero-field splitting (ZFS) parameters based only on the electron spin–spin coupling expectation values. Nuclear quadrupole resonance constants for the different Cl isotopes are also calculated to accomplish the ZFS assignment. The electric dipole activity of the spin sublevels in the triplet–singlet transitions to the ground-state vibrational levels is estimated by calculations of derivatives using distorted geometries which are shifted from the equilibrium position along different vibrational modes. A vibrational analysis of the phosphorescence spectrum, based on the SOC-induced mixing of the singlet and triplet states calculated along different vibrational modes, provides reasonable agreement with experimental data.Acknowledgment O. R.-P. would like to thank the European MOLPROP network for support. The authors thank Alexander Baev for fruitful discussions. This work was supported by the Swedish Royal Academy of Science (KVA).     

Minimum energy configurations on a toric lattice as a quadratic assignment problem

We consider three known bounds for the quadratic assignment problem (QAP): an eigenvalue, a convex quadratic programming (CQP), and a semidefinite programming (SDP) bound. Since the last two bounds were not compared directly before, we prove that the SDP bound is stronger than the CQP bound. We then apply these to improve known bounds on a discrete energy minimization problem, reformulated as a QAP, which aims to minimize the potential energy between repulsive particles on a toric grid. Thus we are able to prove optimality for several configurations of particles and grid sizes, complementing earlier results by Bouman et al. (2013). The semidefinite programs in question are too large to solve without pre-processing, and we use a symmetry reduction method by Permenter and Parrilo (2020) to make computation of the SDP bounds possible.     

Finding normal solutions in piecewise linear programming

Letf: ⁿ (–, ] be a convex polyhedral function. We show that if any standard active set method for quadratic programming (QP) findsx(t)= arg min _x ¦x¦²/2+t f(x) for somet> 0, then its final working set defines a simple equality QP subproblem, whose Lagrange multiplier can be used both for testing ift is large enough forx(t) to coincide with the normal minimizer off, and for increasingt otherwise. The QP subproblem may easily be solved via the matrix factorizations used for findingx(t). This opens up the way for efficient implementations. We also give finite methods for computing the whole trajectory {x(t)} _t 0, minimizingf over an ellipsoid, and choosing penalty parameters inL ₁QP methods for strictly convex QP.This research was supported by the State Committee for Scientific Research under Grant 8S50502206.     

On quadratic forms of height two and a theorem of Wadsworth

Let and be anisotropic quadratic forms over a field of characteristic not . Their function fields and are said to be equivalent (over ) if and are isotropic. We consider the case where and is divisible by an -fold Pfister form. We determine those forms for which becomes isotropic over if , and provide partial results for . These results imply that if and are equivalent and , then is similar to over . This together with already known results yields that if is of height and degree or , and if , then and are equivalent iff and are isomorphic over .

     

Accurate electrical and spectroscopic properties ofX 1Σ+ BeO from coupled-cluster methods

Summary This paper reports a series of coupled-cluster (CC) calculations through CCSDT on the theoretically challenging ground state of the BeO molecule. Along with CC methods, quadratic configuration interaction (QCI) approximations to CC theory have been used (QCISD and QCISD(T)), which show several dramatic failings. Equilibrium electrical properties (, _xx , and _zz ) and basic spectroscopic properties (r _e, _e,D _e, and infrared intensity (I)) have been computed. Basis set and electron correlation effects are analyzed in order to arrive at accurate values of the dipole moment and polarizability, which are not known experimentally. For the dipole moment, we obtain a value of 6.25 D, with an uncertainty of about 0.1 D. For _xx and _zz , we suggest respective values of 32 and 36 atomic units (a.u.) and error bars of about 1 and 2 a.u. With extended basis sets, the spectroscopic propertiesr _e, _e, andD _e are reproduced to high accuracy, which is the first time this has been achieved for this species byab initio methods. At the highest calculation levels,I is predicted to be very small. AlthoughI has not been measured, some support for this prediction comes from a recent infrared study of BeO-rare gas complexes. The QCI methods are shown to be much more sensitive to basis set, and even with large basis sets yield values of _zz andI which differ from CC results by an order of magnitude and three orders of magnitude, respectively. These differences doubtless arise from the importance of single excitations (T ₁) for this molecule, as several terms involvingT ₁ are neglected in the QCISD approximation compared with CCSD. We also report CC calculations with Brueckner orbitals, which yield results similar to those obtained with restricted Hartree-Fock orbitals.     

On a class of least-element complementarity problems

The present paper studies the linear complementarity problem of finding vectorsx andy inR ₊ ⁿ such thatc + Dx + y 0,b – x 0 andx ^T (c + Dx + y) = y ^T (b – x) = 0 whereD is aZ-matrix andb > 0. Complementarity problems of this nature arise, for example, from the minimization of certain quadratic functions subject to upper and lower bounds on the variables. Two least-element characterizations of solutions to the above linear complementarity problem are established first. Next, a new and direct method to solve this class of problems, which depends on the idea of least-element solution is presented. Finally, applications and computational experience with its implementation are discussed.Research partially supported by the National Science Foundation Grant MCS 71-03341 A04 and the Air Force Office of Scientific Research Contract F 44620 14 C 0079.     

Improved estimation of duality gap in binary quadratic programming using a weighted distance measure

We present in this paper an improved estimation of duality gap between binary quadratic program and its Lagrangian dual. More specifically, we obtain this improved estimation using a weighted distance measure between the binary set and certain affine subspace. We show that the optimal weights can be computed by solving a semidefinite programming problem. We further establish a necessary and sufficient condition under which the weighted distance measure gives a strictly tighter estimation of the duality gap than the existing estimations.