AI Chat AI Image Generator AI Video Text to Speech

A Bisection Method to Solve The Elvis Problem With Convex Bounded Velocity Sets

03/15/2023

∙

by Clinten A. Graham, et al.

∙

∙

The Elvis problem has been studied in [2], which proves existence of solutions. However, their computation in the non-smooth case remains unsolved. A bisection method is proposed to solve the Elvis problem in two space dimensions for general convex bounded velocity sets. The convergence rate is proved to be linear. Finally, numerical tests are performed on smooth and non-smooth velocity sets demonstrating the robustness of the algorithm.

Clinten A. Graham
1 publication
Frédéric Marazzato
9 publications
Peter R. Wolenski
1 publication

research

∙ 11/14/2018

Revisiting Projection-Free Optimization for Strongly Convex Constraint Sets

We revisit the Frank-Wolfe (FW) optimization under strongly convex const...

0 Jarrid Rector-Brooks, et al. ∙

research

∙ 01/31/2020

Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems

In this paper we study the smooth convex-concave saddle point problem. S...

0 Noah Golowich, et al. ∙

research

∙ 07/05/2023

Unconditionally stable higher order semi-implicit level set method for advection equations

We present compact semi-implicit finite difference schemes on structured...

0 Peter Frolkovič, et al. ∙

research

∙ 10/25/2016

On the convergence rate of the three operator splitting scheme

The three operator splitting scheme was recently proposed by [Davis and ...

0 Fabian Pedregosa, et al. ∙

research

∙ 09/21/2022

Finite difference methods for linear transport equations

DiPerna-Lions (Invent. Math. 1989) established the existence and uniquen...

0 Kohei Soga, et al. ∙

research

∙ 03/13/2022

A square root velocity framework for curves of bounded variation

The square root velocity transform is a powerful tool for the efficient ...

0 Markus Grasmair, et al. ∙

research

∙ 08/26/2022

Non-probabilistic Supervised Learning for Non-linear Convex Variational Problems

In this article we propose, based on a non-probabilistic supervised lear...

0 Pablo M. Berná, et al. ∙