Related papers: Necessary and sufficient conditions of solution un…

We introduce a new consistency-based approach for defining and solving nonnegative/positive matrix and tensor completion problems. The novelty of the framework is that instead of artificially making the problem well-posed in the form of an…

It is well known that a strictly convex minimand admits at most one minimizer. We prove a partial converse: Let $X$ be a locally convex Hausdorff space and $f \colon X \mapsto \left( - \infty , \infty \right]$ a function with compact…

Necessary and sufficient conditions are presented for the (first-order) theory of a universal class of algebraic structures (algebras) to admit a model completion, extending a characterization provided by Wheeler. For varieties of algebras…

This paper addresses the class of continuous-time nonlinear programming problems with equality and inequality constraints. The paper presents necessary optimality conditions of the sequential form. To be more precise, a sequence of…

Recent quasi-optimal error estimates for the finite element approximation of total-variation regularized minimization problems require the existence of a Lipschitz continuous dual solution. We discuss the validity of this condition and…

This paper presents a convex sufficient condition for solving a system of nonlinear equations under parametric changes and proposes a sequential convex optimization method for solving robust optimization problems with nonlinear equality…

With the widespread adoption of machine learning systems, the need to curtail their behavior has become increasingly apparent. This is evidenced by recent advancements towards developing models that satisfy robustness, safety, and fairness…

In this note we prove uniqueness of the critical point for positive solutions of elliptic problems in bounded planar domains: we first examine the Poisson problem - Delta u = f(x,y) finding a geometric condition involving the curvature of…

We investigate a general formulation for clustering and transductive few-shot learning, which integrates prototype-based objectives, Laplacian regularization and supervision constraints from a few labeled data points. We propose a…

In this paper we are concerned with generalised L 1-minimisation problems, i.e. Bolza problems involving the absolute value of the control with a control-affine dynamics. We establish sufficient conditions for the strong local optimality of…

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 study necessary optimality conditions for the optimization problem $$\textrm{infimum}f_0(x) \quad \textrm{ subject to } \quad x \in S,$$ where $f_0 \colon \mathbb{R}^n \rightarrow \mathbb{R}$ is a polynomial function and $S…

Finding the sparsest solutions to a tensor complementarity problem is generally NP-hard due to the nonconvexity and noncontinuity of the involved $\ell_0$ norm. In this paper, a special type of tensor complementarity problems with…

To explain the decision of any model, we extend the notion of probabilistic Sufficient Explanations (P-SE). For each instance, this approach selects the minimal subset of features that is sufficient to yield the same prediction with high…

Under a mild Lipschitz condition we prove a theorem on the existence and uniqueness of global solutions to delay fractional differential equations. Then, we establish a result on the exponential boundedness for these solutions.

Given $\Omega$ a bounded open subset of $\mathbb{R}^N$, we consider nonnegative solutions to the singular semilinear elliptic equation $-\Delta\,u\,=\,\frac{f}{u^{\beta}}$ in $H^1_{loc}(\Omega)$, under zero Dirichlet boundary conditions.…

We compute the Morse index of $1$-spike solutions of the semilinear elliptic problem \begin{equation}\label{abstr} \tag{$\mathcal P_p$} \begin{cases} -\Delta u= u^p & \text{in $\Omega$} \\ u=0 & \text{on $\partial\Omega$} \\ u>0 & \text{in…

In this paper, we study the solvability problem for one kind of fully coupled forward-backward stochastic difference equations (FBS{\Delta}Es). With the help of the necessary and sufficient condition for the solvability of the linear…

In recent years much effort was put into developing polynomial-time conditional lower bounds for algorithms and data structures in both static and dynamic settings. Along these lines we suggest a framework for proving conditional lower…

The Tikhonov-Phillips method is widely used for regularizing ill-posed inverse problems mainly due to the simplicity of its formulation as an optimization problem. The use of different penalizers in the functionals associated to the…