Related papers: Linear pencils and quadratic programming problems …
Unitary equivariance is a natural symmetry that occurs in many contexts in physics and mathematics. Optimization problems with such symmetry can often be formulated as semidefinite programs for a $d^{p+q}$-dimensional matrix variable that…
The main purpose of this article is to show that the numerical range of a linear pencil $\lambda A + B$ is equal to $\mathbb{C}$ if and only if $0$ belongs to the convex hull of the joint numerical range of $A$ and $B$. We also prove that…
A novel algorithm to solve the quadratic programming problem over ellipsoids is proposed. This is achieved by splitting the problem into two optimisation sub-problems, quadratic programming over a sphere and orthogonal projection. Next, an…
We study linear problems defined on tensor products of Hilbert spaces with an additional (anti-) symmetry property. We construct a linear algorithm that uses finitely many continuous linear functionals and show an explicit formula for its…
This paper begins with a class of convex quadratic programs (QPs) with bounded variables solvable by the parametric principal pivoting algorithm with $\mathcal{O}(n^3)$ strongly polynomial complexity, where $n$ is the number of variables of…
For a class of semilinear elliptic equations, we establish criteria that guarantee that the linearized operator associated with a solution satisfies certain spectral assumptions that are widely used in the analysis of the stability of…
We introduce a new technique for solving uni-parametric versions of linear programs, convex quadratic programs, and linear complementarity problems in which a single parameter is permitted to be present in any of the input data. We…
Let $\Delta$ be a linear differential operator acting on the space of densities of a given weight $\lo$ on a manifold $M$. One can consider a pencil of operators $\hPi(\Delta)=\{\Delta_\l\}$ passing through the operator $\Delta$ such that…
Sharp resolvent bounds for non-selfadjoint semiclassical elliptic quadratic differential operators are established, in the interior of the range of the associated quadratic symbol.
In this paper, a quadratic pencil of Schr\"odinger type difference operator $L_{\lambda}$ is taken under investigation to give a general perspective on the spectral analysis of non-selfadjoint difference equations of second order.…
The problem of the determination of the Hilbert-space metric which renders a given Hamiltonian $H$ self-adjoint is addressed from the point of view of applicability of computer-assisted algebraic manipulations. An exactly solvable example…
In this paper operator pencils $A(x,D,\lambda)$ are investigated which depend polynomially on the parameter $\lambda$ and act on a manifold with boundary. The operator A is assumed to satisfy the condition of N-ellipticity with parameter…
The paper covers a formulation of the inverse quadratic programming problem in terms of unconstrained optimization where it is required to find the unknown parameters (the matrix of the quadratic form and the vector of the quasi-linear part…
This paper investigates spectral properties of certain classes of positive operators originated from different matrices appeared in linear complementarity problem. These positive operators play a crucial role in various areas of mathematics…
When applying eigenvalue decomposition on the quadratic term matrix in a type of linear equally constrained quadratic programming (EQP), there exists a linear mapping to project optimal solutions between the new EQP formulation where $Q$ is…
In this note, we define a bounded variant on the Hilbert projective metric on an infinite dimensional space $E$ and study the contraction properties of the projective maps associated with positive linear operators on $E$. More precisely, we…
We propose an algorithm for solving bound-constrained mathematical programs with complementarity constraints on the variables. Each iteration of the algorithm involves solving a linear program with complementarity constraints in order to…
This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linear programming to solving linear programs of…
We study the properties of the constructive linear programing problems. The parameters of linear functions in such problems are constructive real numbers. To solve such a problem is to find the optimal plan with the constructive real number…
We give canonical forms of selfadjoint and isometric operators on a complex vector space $U$ with scalar product given by a positive semidefinite Hermitian form, and of Hermitian forms on $U$. For an arbitrary system of semiunitary spaces…