Related papers: Well-posedness of constrained minimization problem…
We formulate a well-posedness and approximation theory for a class of generalised saddle point problems with a specific form of constraints. In this way we develop an approach to a class of fourth order elliptic partial differential…
We give a characterization of completely regular topological spaces. Applying some recent results for supinf problems in completely regular topological spaces we establish a variational principle for saddle points. Well-posedness of saddle…
A choice of first-order variables for the characteristic problem of the linearized Einstein equations is found which casts the system into manifestly well-posed form. The concept of well-posedness for characteristic problems invoked is that…
This paper works with preconvexlike set-valued vector optimization problems in topological linear spaces. A Fakas-Minkowski alternative theorem, a scalarization theorem, some vector saddle-point theorems and some scalar saddle point theorem…
One revisits the standard saddle-point method based on conjugate duality for solving convex minimization problems. Our aim is to reduce or remove unnecessary topological restrictions on the constraint set. Dual equalities and…
We study the initial value problem associated to the dispersion generalized Benjamin-Ono equation. Our aim is to establish well-posedness results in weighted Sobolev spaces via contraction principle under minimal requirements in the…
This paper considers a large class of linear operator equations, including linear boundary value problems for partial differential equations, and treats them as linear recovery problems for objects from their data. Well-posedness of the…
The goal of this article is to study necessary and sufficient conditions for the exactness of penalty functions and the existence of global saddle points of augmented Lagrangians for well-posed (in a suitable sense) constrained optimization…
The first order condition of the constrained minimization problem leads to a saddle point problem. A multigrid method using a multiplicative Schwarz smoother for saddle point problems can thus be interpreted as a successive subspace…
Recently, the problem of local minima in very high dimensional non-convex optimization has been challenged and the problem of saddle points has been introduced. This paper introduces a dynamic type of normalization that forces the system to…
We formulate a well-posedness and approximation theory for a class of generalised saddle point problems. In this way we develop an approach to a class of fourth order elliptic partial differential equations using the idea of splitting into…
The Monge-Kantorovich problem is revisited by means of a variant of the saddle-point method without appealing to $c$-conjugates. A new abstract characterization of the optimal plans is obtained in the case where the cost function takes…
Local and global well-posedness results are established for the initial value problem associated to the 1D Zakharov-Rubenchik system. We show that our results are sharp in some situations by proving Ill-posedness results otherwise. The…
In this paper we prove well-posedness and stabibility of a class of stochastic delay differential equations with singular drift. Moreover, we show local well-posedness under localized assumptions.
This is a companion note to Zinde-Walsh (2010), arXiv:1009.4217v1[MATH.ST], to clarify and extend results on identification in a number of problems that lead to a system of convolution equations. Examples include identification of the…
We show that first order semilinear PDEs by stochastic perturbation are well-posedness for globally Holder continuous and bounded vector field, with an integrability condition on the divergence. This result extends the liner case presented…
Building upon the minimal time function, we propose and study a novel notion of Tykhonov well-posedness with respect to a set of directions for optimization problems. This concept generalizes the classical Tykhonov well-posedness by…
This study develops a fixed-time convergent saddle point dynamical system for solving min-max problems under a relaxation of standard convexity-concavity assumption. In particular, it is shown that by leveraging the dynamical systems…
We prove global well-posedness for the 3D Klein-Gordon equation with a concentrated nonlinearity.
We introduce a new sequential subspace optimization method for large-scale saddle-point problems. It solves iteratively a sequence of auxiliary saddle-point problems in low-dimensional subspaces, spanned by directions derived from…