29 citations · 60 across the 28 of their papers we have counts for
6 papers · 2 filters
Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples
R. Díaz Millán, Scott B. Lindstrom, Vera Roshchina
We focus on the convergence analysis of averaged relaxations of cutters, specifically for variants that---depending upon how parameters are chosen---resemble \emph{alternating proj…
VADU 2018 Open Problem Session
Bui Thi Hoa, Scott Lindstrom, Vera Roshchina
We state the problems discussed in the open problem session at Variational Analysis Down Under (VADU2018) conference held in honour of Prof. Asen Dontchev's 70th birthday on 19--21…
A data-independent distance to infeasibility for linear conic systems
Javier Pena, Vera Roshchina
We offer a unified treatment of distinct measures of well-posedness for homogeneous conic systems. To that end, we introduce a distance to infeasibility based entirely on geometric…
Refining the partition for multifold conic optimization problems
Héctor Ramírez, Vera Roshchina
In this paper we give a unified treatment of two different definitions of complementarity partition of multifold conic programs introduced independently in [J. F. Bonnans and H. Ra…
The Demyanov-Ryabova conjecture is false
Vera Roshchina
It was conjectured by Vladimir Demyanov and Julia Ryabova in 2011 that the minimal cycle in the sequence obtained via repeated application of Demyanov converter to a finite family…
A counterexample to De Pierro's conjecture on the convergence of under-relaxed cyclic projections
Roberto Cominetti, Vera Roshchina, Andrew Williamson
The convex feasibility problem consists in finding a point in the intersection of a finite family of closed convex sets. When the intersection is empty, a best compromise is to sea…