Weak Copositive and Intertwining Approximation

It is known that shape preserving approximation has lower rates than unconstrained approximation. This is especially true for copositive and intertwining approximations. ForfL_p, 1p<∞, the former only has rateω(f, n⁻¹)_p, and the latter cannot even be bounded byC f_p. In this paper, we discuss various ways to relax the restrictions in these approximations and conclude that the most sensible way is the so-calledalmostcopositive/intertwining approximation in which one relaxes the restriction on the approximants in a neighborhood of radiusΔ_n(y_j) of each sign changey_j.     

On copositive approximation in some classical spaces of sequences

In this paper the author writes a simple characterization for the best copositive approximation in c; the space of convergent sequences, by elements of finite dimensional Chebyshev subspaces, and shows that it is unique.     

Copositive approximation of periodic functions

Let f be a real continuous 2π-periodic function changing its sign in the fixed distinct points y _i ∈ Y:= {y _i } _i∈ℤ such that for x ∈ [y _i , y _i−1], f(x) ≧ 0 if i is odd and f(x) ≦ 0 if i is even. Then for each n ≧ N(Y) we construct a trigonometric polynomial P _n of order ≦ n, changing its sign at the same points y _i ∈ Y as f, and

Using copositivity for global optimality criteria in concave quadratic programming problems

In this note we specify a necessary and sufficient condition for global optimality in concave quadratic minimization problems. Using this condition, it follows that, from the perspective of worst-case complexity of concave quadratic problems, the difference between local and global optimality conditions is not as large as in general. As an essential ingredient, we here use the-subdifferential calculus via an approach of Hiriart-Urruty and Lemarechal (1990).     

Contribution of copositive formulations to the graph partitioning problem

This article provides analysis of several copositive formulations of the graph partitioning problem and semidefinite relaxations based on them. We prove that the copositive formulations based on results from Burer [S. Burer, On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120 (Ser. A) (2009), pp. 479–495] and the author of the paper [J. Povh, Semidefinite approximations for quadratic programs over orthogonal matrices. J. Global Optim. 48 (2010), pp. 447–463] are equivalent and that they both imply semidefinite relaxations which are stronger than the Donath–Hoffman eigenvalue lower bound [W.E. Donath and A.J. Hoffman, Lower bounds for the partitioning of graphs. IBM J. Res. Develop. 17 (1973), pp. 420–425] and the projected semidefinite lower bound from Wolkowicz and Zhao [H. Wolkowicz and Q. Zhao, Semidefinite programming relaxations for the graph partitioning problem. Discrete Appl. Math. 96–97 (1999), pp. 461–479].     

Gap,cosum and product properties of the θ′ bound on the clique number

In a paper published in 1978, McEliece, Rodemich and Rumsey improved the Lovász bound θ for the maximum clique problem. This strengthening has become well known under the name Lovász–Schrijver bound and is usually denoted by θ′. This article now deals with situations where this bound is not exact. To provide instances for which the gap between this bound and the actual clique number can be arbitrarily large, we establish homomorphy results for this bound under cosums and products of graphs. In particular we show that for circulant graphs of prime order there must be a positive gap between the clique number and the bound.