Related papers: Regularity and stability for a convex feasibility …
Constraint tightening to non-conservatively guarantee recursive feasibility and stability in Stochastic Model Predictive Control is addressed. Stability and feasibility requirements are considered separately, highlighting the difference…
We present a general framework how to investigate stability of solutions within a single self-consistent renormalization scheme being a parquet-type extension of the Baym-Kadanoff construction of conserving approximations. To obtain a…
Let $A=(a_1,\ldots,a_n)$ and $B=(b_1,\ldots,b_n)$ be two sequences of nonnegative integers with $a_i \le b_i$ for $1\le i\le n$. The pair $(A;B)$ is said to be realizable by a graph if there exists a simple graph $G$ with vertices…
We prove stability results for nonlinear diffusion equations of the porous medium and fast diffusion types with respect to the nonlinearity power $m$: solutions with fixed data converge in a suitable sense to the solution of the limit…
In this paper, by using admissible sets, we give some fixed point results for orbitally contractions which diminish the radius of invariant convex subsets and orbits. Furthermore, a characterization of the weak normal structure by the fixed…
We introduce a new class of asymptotic contractions that employs two quasi-metrics defined directly in terms of the underlying mapping. The contraction condition compares these two quantities via a sequence of bounding functions that…
We consider a family of 3D models for the axi-symmetric incompressible Navier-Stokes equations. The models are derived by changing the strength of the convection terms in the axisymmetric Navier-Stokes equations written using a set of…
We consider a classical problem of linear stability of convective rolls in a plane layer with stress-free horizontal boundaries near the onset of convection. The problem has been studied by a number of authors, who have shown that rolls of…
A convex polyhedron is called monostable if it can rest in stable position only on one of its faces. The aim of this paper is to investigate three questions of Conway, regarding monostable polyhedra, which first appeared in a 1969 paper of…
Confirming a conjecture posed by Caro, it was shown by Chen and Yu that every graph $G$ with $n$ vertices and at most $2n-4$ edges has a stable cutset, which is a stable set of vertices whose removal disconnects the graph. Le and Pfender…
This paper investigates probabilistic robustness of nonconvex-nonconcave minimax problems via the scenario approach. Specifically, under convex strategy sets for all players, inspired by recent advances in scenario optimization, we first…
Let (X_n) be a sequence of random variables (with values in a separable metric space) and (N_n) a sequence of random indices. Conditions for X_{N_n} to converge stably (in particular, in distribution) are provided. Some examples, where such…
In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consistency properties from properties on set intersection. This…
Recently, a new local optimality concept for minimax problems, termed calm local minimax points, has been introduced. In this paper, we extend this concept to a general class of nonsmooth, nonconvex nonconcave minimax problems with coupled…
In this paper, we study the relations between the numerical structure of the optimal solutions of a convex programming problem defined on the edge set of a simple graph and the stability number (i.e. the maximum size of a subset of pairwise…
In this paper we show that when individuals in a bipartite network exclusively choose partners and exchange valued goods with their partners, then there exists a set of exchanges that are pair-wise stable. Pair-wise stability implies that…
Networks of coupled neural systems represent an important class of models in computational neuroscience. In some applications it is required that equilibrium points in these networks remain stable under parameter variations. Here we present…
The convergence of the algorithm for solving convex feasibility problem is studied by the method of sequential averaged and relaxed projections. Some results of H. H. Bauschke and J. M. Borwein are generalized by introducing new methods.…
A graph with convex quadratic stability number is a graph for which the stability number is determined by solving a convex quadratic program. Since the very beginning, where a convex quadratic programming upper bound on the stability number…
For a dynamic system consisting of $n$ point vortices in an ideal plane fluid with a steady, incompressible and} irrotational background flow, a more physically significant definition of a fixed equilibrium configuration is suggested. Under…