Related papers: Stability of a convex feasibility problem

The concept of a visible point of a convex set relative to a given point is introduced. A number of basic properties of such visible point sets is developed. In particular, it is shown that this concept is useful in the study of best…

Level-set methods for convex optimization are predicated on the idea that certain problems can be parameterized so that their solutions can be recovered as the limiting process of a root-finding procedure. This idea emerges time and again…

The problem of computing a common point that lies in the intersection of a finite number of closed convex sets, each known to one agent in a network, is studied. This issue, known as the distributed convex feasibility problem or the…

We consider the convex bilevel optimization problem, also known as simple bilevel programming. There are two challenges in solving convex bilevel optimization problems. Firstly, strong duality is not guaranteed due to the lack of Slater…

In this paper, we consider convex feasibility problems where the underlying sets are loosely coupled, and we propose several algorithms to solve such problems in a distributed manner. These algorithms are obtained by applying proximal…

The Fermat--Steiner problem is to find all points of the metric space Y such that the sum of the distances from each of them to points from some fixed finite subset A = {A_1, ..., A_n} of the space Y is minimal. This problem is considered…

Solutions of bilevel optimization problems tend to suffer from instability under changes to problem data. In the optimistic setting, we construct a lifted formulation that exhibits desirable stability properties under mild assumptions that…

In this paper, we consider one-to-one matchings between two disjoint groups of agents. Each agent has a preference over a subset of the agents in the other group, and these preferences may contain ties. Strong stability is one of the…

This work proposes an algorithm to bound the minimum distance between points on trajectories of a dynamical system and points on an unsafe set. Prior work on certifying safety of trajectories includes barrier and density methods, which do…

We examine the minimal magnitude of perturbations necessary to change the number $N$ of static equilibrium points of a convex solid $K$. We call the normalized volume of the minimally necessary truncation robustness and we seek shapes with…

This paper revisits the well-studied fixed point problem from a unified viewpoint of mathematical modeling and canonical duality theory, i.e. the original problem is first reformulated as a nonconvex optimization problem, its well-posedness…

In this report we discuss and propose a correction to a convergence and stability issue occurring in the work of Da et al.[2015], in which they proposed a numerical model to simulate soap bubbles.

Let $E\subset \mathbb R^n$, $n\ge 2$, be a set of finite perimeter with $|E|=|B|$, where $B$ denotes the unit ball. When $n=2$, since convexification decreases perimeter (in the class of open connected sets), it is easy to prove the…

This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…

We consider the problem of minimizing convex combinations of the first two eigenvalues of the Dirichlet-Laplacian among open sets of $R^N$ of fixed measure. We show that, by purely elementary arguments, based on the minimality condition, it…

Let $K$ be a convex body (a non-empty compact convex set) in $n$-dimensional Euclidean space. A set $B$ is called a barrier (or an `opaque set') for $K$ if every line that intersects $K$, also intersects $B$. Although this concept was…

In this letter, by regarding finite-time stability as an inverse problem, we reveal the essence of finite-time stability and fixed-time stability. Some necessary and sufficient conditions are given. As application, we give a new approach…

In this article we consider a consistent convex feasibility problem in a real Hilbert space defined by a finite family of sets $C_i$. We are interested, in particular, in the case where for each $i$, $C_i=Fix (U_i)=\{z\in \mathcal H\mid…

We prove stability for a coefficient determination problem for a two velocity 2x2 system of hyperbolic PDEs in one space dimension.

The main purpose of this paper is to determine the solution of generalized convex set-valued mappings satisfying certain functional equation. Some conclusions of stability of set-valued functional equations are obtained.