Related papers: Well-posedness of constrained minimization problem…
The article is devoted to the development of numerical methods for solving saddle point problems and variational inequalities with simplified requirements for the smoothness conditions of functionals. Recently there were proposed some…
We consider the problem of finding local minimizers in non-convex and non-smooth optimization. Under the assumption of strict saddle points, positive results have been derived for first-order methods. We present the first known results for…
Recently, in (M. Masoudi, D.K. Salkuyeh, An extension of positive-definite and skew-Hermitian splitting method for preconditioning of generalized saddle point problems, Computers \& Mathematics with Application,…
This paper shows that a perturbed form of gradient descent converges to a second-order stationary point in a number iterations which depends only poly-logarithmically on dimension (i.e., it is almost "dimension-free"). The convergence rate…
We consider the well-posedness of the initial value problem associated to the k-generalized Zakharov-Kuznetsov equation in fractional weighted Sobolev spaces. Our method of proof is based on the contraction mapping principle and it mainly…
In this paper we consider well-posedness properties of vector optimization problems with objective function $f: X \to Y$ where $X$ and $Y$ are Banach spaces and $Y$ is partially ordered by a closed convex pointed cone with nonempty…
We review the concept of well-posedness in the context of evolutionary problems from mathematical physics for a particular subclass of problems from elasticity theory. The complexity of physical phenomena appears as encoded in so called…
In this paper, we establish an improved version of a saddle point theorem ([4]) removing a weak lower semicontinuity assumption at all. We then revisit some of the applications of that theorem in the light of such an improvement. For…
We present an application of recent well-posedness results in the theory of delay differential equations for ordinary differential equations arXiv:2308.04730 to a generalized population model for stem cell maturation. The weak approach…
In this paper we consider multiple saddle point problems with block tridiagonal Hessian in a Hilbert space setting. Well-posedness and the related issue of preconditioning are discussed. We give a characterization of all block structured…
We show local well-posedness for the Mullins-Sekerka system with ninety degree angle boundary contact. We will describe the motion of the moving interface by a height function over a fixed reference surface. Using the theory of maximal…
We discuss strong local and global well-posedness for the three-dimensional NLS equation with nonlinearity concentrated on $\mathbb{S}^2$. Precisely, local well-posedness is proved for any $C^2$ power-nonlinearity, while global…
This paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points. It is based on solving Lasserre's hierarchy of semidefinite relaxations. Under some genericity assumptions on defining…
We study the performance of stochastic first-order methods for finding saddle points of convex-concave functions. A notorious challenge faced by such methods is that the gradients can grow arbitrarily large during optimization, which may…
Using the setting of $G$-metric spaces, common fixed point theorems for four maps satisfying the weakly commuting conditions are obtained for various generalized contractive conditions. Several examples are also presented to show the…
The theory of mixed finite element methods for solving different types of elliptic partial differential equations in saddle point formulation is well established since many decades. This topic was mostly studied for variational formulations…
In this paper, we prove the local well-posedness of the Ericksen-Leslie system, and the global well-posednss for small initial data under the physical constrain condition on the Leslie coefficients, which ensures that the energy of the…
Saddle-point problems appear in various settings including machine learning, zero-sum stochastic games, and regression problems. We consider decomposable saddle-point problems and study an extension of the alternating direction method of…
In the paper, we develop a composite version of Mirror Prox algorithm for solving convex-concave saddle point problems and monotone variational inequalities of special structure, allowing to cover saddle point/variational analogies of what…
Based on the needs of convergence proofs of preconditioned proximal point methods, we introduce notions of partial strong submonotonicity and partial (metric) subregularity of set-valued maps. We study relationships between these two…