Scenario-Based Motion Planning with Bounded Probability of Collision

O de Groot, L Ferranti, D Gavrila… - arXiv preprint arXiv …, 2023 - arxiv.org
Robots will increasingly operate near humans that introduce uncertainties in the motion
planning problem due to their complex nature. Typically, chance constraints are introduced …

A product space reformulation with reduced dimension for splitting algorithms

R Campoy - Computational Optimization and Applications, 2022 - Springer
In this paper we propose a product space reformulation to transform monotone inclusions
described by finitely many operators on a Hilbert space into equivalent two-operator …

Millimeter wave cell-free massive MIMO systems: Joint beamforming and AP-user association

J Wang, B Wang, J Fang, H Li - IEEE Wireless Communications …, 2021 - ieeexplore.ieee.org
We consider the problem of joint beamforming and access point (AP)-user association for
downlink millimeter Wave (mmWave) cell-free (CF) massive MIMO systems. Such a problem …

Shaping dynamical neural computations using spatiotemporal constraints

JZ Kim, B Larsen, L Parkes - Biochemical and Biophysical Research …, 2024 - Elsevier
Dynamics play a critical role in computation. The principled evolution of states over time
enables both biological and artificial networks to represent and integrate information to …

Quasioptimal alternating projections and their use in low-rank approximation of matrices and tensors

S Budzinskiy - arXiv preprint arXiv:2308.16097, 2023 - arxiv.org
We study the convergence of specific inexact alternating projections for two non-convex sets
in a Euclidean space. The $\sigma $-quasioptimal metric projection ($\sigma\geq 1$) of a …

On the circumcentered-reflection method for the convex feasibility problem

R Behling, Y Bello-Cruz, LR Santos - Numerical Algorithms, 2021 - Springer
The ancient concept of circumcenter has recently given birth to the circumcentered-reflection
method (CRM). CRM was first employed to solve best approximation problems involving …

The circumcentered-reflection method achieves better rates than alternating projections

R Arefidamghani, R Behling, Y Bello-Cruz… - Computational …, 2021 - Springer
We study the convergence rate of the Circumcentered-Reflection Method (CRM) for solving
the convex feasibility problem and compare it with the Method of Alternating Projections …

The block-wise circumcentered–reflection method

R Behling, JY Bello-Cruz, LR Santos - Computational Optimization and …, 2020 - Springer
The elementary Euclidean concept of circumcenter has recently been employed to improve
two aspects of the classical Douglas–Rachford method for projecting onto the intersection of …

Strict pseudocontractions and demicontractions, their properties, and applications

A Cegielski - Numerical Algorithms, 2024 - Springer
We give properties of strict pseudocontractions and demicontractions defined on a Hilbert
space, which constitute wide classes of operators that arise in iterative methods for solving …

Strengthened splitting methods for computing resolvents

FJ Aragón Artacho, R Campoy, MK Tam - Computational Optimization and …, 2021 - Springer
In this work, we develop a systematic framework for computing the resolvent of the sum of
two or more monotone operators which only activates each operator in the sum individually …