3 citations · 10 across the 7 of their papers we have counts for
7 papers
Optimization hierarchies for distance-avoiding sets in compact spaces
Bram Bekker, Olga Kuryatnikova, Fernando Mário de Oliveira Filho +1
Witsenhausen's problem asks for the maximum fraction of the -dimensional unit sphere that can be covered by a measurable set containing no pairs of orthogonal points. The…
Two-Stage Robust Quadratic Optimization with Equalities and its Application to Optimal Power Flow
Olga Kuryatnikova, Bissan Ghaddar, Daniel K. Molzahn
In this work, we consider two-stage quadratic optimization problems under ellipsoidal uncertainty. In the first stage, one needs to decide upon the values of a subset of optimizati…
The maximum -colorable subgraph problem and related problems
Renata Sotirov, Olga Kuryatnikova, Juan Vera
The maximum -colorable subgraph (MCS) problem is to find an induced -colorable subgraph with maximum cardinality in a given graph. This paper is an in-depth analysis of th…
Reducing non-negativity over general semialgebraic sets to non-negativity over simple sets
Olga Kuryatnikova, Juan C. Vera, Luis F. Zuluaga
A non-negativity certificate (NNC) is a way to write a polynomial so that its non-negativity on a semialgebraic set becomes evident. Positivstellensätze (Psätze) guarantee the exis…
Generalizations of Schoenberg's theorem on positive definite kernels
Olga Kuryatnikova, Juan C. Vera
The seminal theorem of I.J. Schoenberg characterizes positive definite (p.d.) kernels on the unit sphere invariant under the automorphisms of the sphere. We obtain two ge…
Positive semidefinite approximations to the cone of copositive kernels
Olga Kuryatnikova, Juan C. Vera
It has been shown that the maximum stable set problem in some infinite graphs, and the kissing number problem in particular, reduces to a minimization problem over the cone of copo…
New bounds for truthful scheduling on two unrelated selfish machines
Olga Kuryatnikova, Juan C. Vera
We consider the minimum makespan problem for tasks and two unrelated parallel selfish machines. Let be the best approximation ratio of randomized monotone scale-free algo…