Abstract. Hiriart-Urruty and Seeger have posed the problem of finding the maximal possible angle θmax(Cn) between two copositive matrices of order n [J.-B. Hiriart-Urruty and A. Seeger. A variational approach to copositive matrices. SIAM Rev., 52:593–629, 2010.]. They have proved that θmax(C2) = 3 4 pi and conjectured that θmax(Cn) is equal t
International audienceIn this paper we construct new families of extremal copositive matrices in arb...
The copositive cone, and its dual the completely positive cone, have useful applications in optimisa...
We investigate the hierarchy of conic inner approximations Kn(r) (r∈N) for the copositive cone COPn,...
Linear Algebra by an authorized administrator of Wyoming Scholars Repository. For more information, ...
In this article, we introduce a new method of certifying any copositive matrix to be copositive. Thi...
International audienceWe say that a symmetric matrix A is copositive if v^TAv ≥ 0 for all nonnegativ...
We consider linear optimization problems over the cone of copositive matrices. Such conic optimizati...
AbstractLet E be the set of symmetric matrices in which every entry is 0 or ±1 and each diagonal ent...
AbstractA real n × n matrix is termed almost copositive if it is not copositive but all its principa...
In copositive optimization, it is essential to determine the minimal num-ber of nonnegative vectors ...
In this report we discuss the set of copositive plus matrices and their properties. We examine certa...
AbstractAndersson et al. [L.E. Andersson, G. Chang, T. Elfving, Criteria for copositive matrices usi...
Copositive programming deals with optimization over the convex cone of so-called copositive matrices...
AbstractLet A∈Rn×n. We provide a block characterization of copositive matrices, with the assumption ...
International audienceThis work surveys essential properties of the so-called copositive matrices, t...
International audienceIn this paper we construct new families of extremal copositive matrices in arb...
The copositive cone, and its dual the completely positive cone, have useful applications in optimisa...
We investigate the hierarchy of conic inner approximations Kn(r) (r∈N) for the copositive cone COPn,...
Linear Algebra by an authorized administrator of Wyoming Scholars Repository. For more information, ...
In this article, we introduce a new method of certifying any copositive matrix to be copositive. Thi...
International audienceWe say that a symmetric matrix A is copositive if v^TAv ≥ 0 for all nonnegativ...
We consider linear optimization problems over the cone of copositive matrices. Such conic optimizati...
AbstractLet E be the set of symmetric matrices in which every entry is 0 or ±1 and each diagonal ent...
AbstractA real n × n matrix is termed almost copositive if it is not copositive but all its principa...
In copositive optimization, it is essential to determine the minimal num-ber of nonnegative vectors ...
In this report we discuss the set of copositive plus matrices and their properties. We examine certa...
AbstractAndersson et al. [L.E. Andersson, G. Chang, T. Elfving, Criteria for copositive matrices usi...
Copositive programming deals with optimization over the convex cone of so-called copositive matrices...
AbstractLet A∈Rn×n. We provide a block characterization of copositive matrices, with the assumption ...
International audienceThis work surveys essential properties of the so-called copositive matrices, t...
International audienceIn this paper we construct new families of extremal copositive matrices in arb...
The copositive cone, and its dual the completely positive cone, have useful applications in optimisa...
We investigate the hierarchy of conic inner approximations Kn(r) (r∈N) for the copositive cone COPn,...