An alternative method for a global analysis of quadratic programs in a finite number of steps

This paper considers the global analysis of general quadratic programs in a finite number of steps. A procedure is presented for recursively finding either the global minimum or a halfline of the constraint set along which the minimand is unbounded below.Research was partially supported by the U.S. Energy Research and Development Administration Contract EY-76-S-03-0326 PA #18; the Office of Naval Research Contracts N00014-75-C-0267 and N00014-75-C-0865; and the National Science Foundation Grants MCS76-20019 and MCS76-81259.     

Improved algorithm for mixed-integer quadratic programs and a computational study

In a recent paper [6] we suggested an algorithm for solving complicated mixed-integer quadratic programs, based on an equivalent formulation that employs a nonsingular transformation of variables. The objectives of the present paper are two. First, to present an improved version of this algorithm, which reduces substantially its computational requirements; second, to report on the results of a computational study with the revised algorithm.     

Inverse problem for a quadratic pencil of Sturm-Liouville operator

The purpose of this paper is to solve the inverse problem for a quadratic pencil of Sturm-Liouville operator on a finite interval. By using the Hochstadt's method, it is shown that the potential function can be given from two spectras as uniquely. Later, by generalizing this result, the Hochstadt's theorem which is related to the structure of difference for the potential functions is obtained.     

A polynomially bounded algorithm for a singly constrained quadratic program

This paper presents a characterization of the solutions of a singly constrained quadratic program. This characterization is then used in the development of a polynomially bounded algorithm for this class of problems.     

A necessary condition for the minimum of a quadratic form under rearrangements

A necessary condition is derived for a quadratic form p^tGp to be minimal among all permutations of the nonnegative nontrivial vector p. The quadratic form arises from the stability problem of a fixed-fixed taut string loaded with masses at equidistant points.     

On consecutive quadratic non-residues: a conjecture of Issai Schur

Issai Schur once asked if it was possible to determine a bound, preferably using elementary methods, such that for all prime numbers p greater than the bound, the greatest number of consecutive quadratic non-residues modulo p is always less than p^1/2. This paper uses elementary methods to prove that 13 is the only prime number for which the greatest number of consecutive quadratic non-residues modulo p exceeds p^1/2.     

A note on a polynomial time solvable case of the quadratic assignment problem

We identify a class of instances of the Koopmans–Beckmann form of the Quadratic Assignment Problem that are solvable in polynomial time. This class is characterized by a path structure in the flow data and a grid structure in the distance data. Chr18b, one of the test problems in the QAPLIB, is in this class even though this feature of it has not been noticed until now.     

Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints

In the area of broad-band antenna array signal processing, the global minimum of a quadratic equality constrained quadratic cost minimization problem is often required. The problem posed is usually characterized by a large optimization space (around 50–90 tuples), a large number of linear equality constraints, and a few quadratic equality constraints each having very low rank quadratic constraint matrices. Two main difficulties arise in this class of problem. Firstly, the feasibility region is nonconvex and multiple local minima abound. This makes conventional numerical search techniques unattractive as they are unable to locate the global optimum consistently (unless a finite search area is specified). Secondly, the large optimization space makes the use of decision-method algorithms for the theory of the reals unattractive. This is because these algorithms involve the solution of the roots of univariate polynomials of order to the square of the optimization space. In this paper we present a new algorithm which exploits the structure of the constraints to reduce the optimization space to a more manageable size. The new algorithm relies on linear-algebra concepts, basic optimization theory, and a multivariate polynomial root-solving tool often used by decision-method algorithms.This research was supported by the Australian Research Council and the Corporative Research Centre for Broadband Telecommunications and Networking.     

Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm

In a recent paper Tardos described a polynomial algorithm for solving linear programming problems in which the number of arithmetic steps depends only on the size of the numbers in the constraint matrix and is independent of the size of the numbers in the right hand side and the cost coefficients. In this paper we extend Tardos' results and present a polynomial algorithm for solving strictly convex quadratic programming problems in which the number of arithmetic steps is independent of the size of the numbers in the right hand side and the linear cost coefficients.This research was partially supported by the Natural Sciences and Engineering Research Council of Canada Grant 5-83998.     

On a functional inequality connected with quadratic functionals

In the present paper we investigate some functional inequalities which are closely connected with quadratic functionals. In particular, we are interested in inequalities of the type

     

On a family of highly regular graphs by Brouwer,Ivanov, and Klin

Highly regular graphs for which not all regularities are explainable by symmetries are fascinating creatures. Some of them like, e.g., the line graph of W. Kantor’s non-classical $GQ(5^2,5)$, are stumbling stones for existing implementations of graph isomorphism tests. They appear to be extremely rare and even once constructed it is difficult to prove their high regularity. Yet some of them, like the McLaughlin graph on 275 vertices and Ivanov’s graph on 256 vertices are of profound beauty. This alone makes it an attractive goal to strive for their complete classification or, failing this, at least to get a deep understanding of them. Recently, one of the authors discovered new methods for proving high regularity of graphs. Using these techniques, in this paper we study a classical family of strongly regular graphs, originally discovered by A.E. Brouwer, A.V. Ivanov, and M.H. Klin in the late 80s. We analyse their symmetries and show that they are $(3,5)$-regular but not 2-homogeneous. Thus we promote these graphs to the distinguished club of highly regular graphs with few symmetries.     

Quadratic convergence of a special quasi-cyclic Jacobi method

This paper considers the ultimate asymptotic convergence of a block- oriented, quasi-cyclic Jacobi method for symmetric matrices. The conclusion applies to the new one-sided Jacobi method for computing the singular value decomposition, recently proposed by Drmač and Veselić. Using a simple qualitative analysis, the discussion indicates that a quadratic off-norm reduction per quasi-sweep is to be expected in all perceivable cases.      

Characterization of quadratic mappings through a functional inequality

We provide conditions under which every solution (f,?) of the functional inequality

     

The generalized Hyers-Ulam-Rassias stability of a cubic functional equation

In this paper, we obtain the general solution and the generalized Hyers-Ulam stability for a cubic functional equation f(2x+y)+f(2x−y)=2f(x+y)+2f(x−y)+12f(x).     

Hyers-Ulam stability of a generalized Apollonius type quadratic mapping

Let X,Y be linear spaces. It is shown that if a mapping satisfies the following functional equation:

(0.1)     

On the Conditions of a Center and General Integrals of Quadratic Differential Systems

We give the general integral of quadratic differential system with center in two cases under the Chinese classification. Project supported by the National Natural Science Foundation of China and Natural Science Foundation of Jiangsu Province Education Commission     

A quasilinearization method for a class of integro-differential equations with mixed nonlinearities

We develop an extended form of the quasilinearization method for an initial value problem involving a nonlinear integro-differential equation with mixed nonlinearities, occurring in distributed-infective and distributed-contact models. In fact, a monotone sequence of iterates converging uniformly and quadratically to a solution of the problem is obtained. Some interesting observations are presented.     

具有二重抛物线解的二次系统

本文给出了具有二重抛物线解的二次系统的一般形状，并与具有并重抛物线解的二次系统相比较，证明了具有二重抛物线解的二次系统也有存在极限环的可能的，而且也是唯一的，但是二重抛物线解却是不可能成为二次系统的分界线不的。