Related papers: A constant rank theorem for partial convex solutio…
Given a differential or $q$-difference equation $P$ of order $n$, we prove that the set of exponents of a generalized power series solution has its rational rank bounded by the rational rank of the support of $P$ plus $n$. We also prove…
In this paper, we explain a new Iterative Method-Fixed Point and develop its convergence theory for finding approximate solutions of nonlinear equations in the setting of Banach spaces. First, we discuss the convergence analysis of our…
In many applications that require matrix solutions of minimal rank, the underlying cost function is non-convex leading to an intractable, NP-hard optimization problem. Consequently, the convex nuclear norm is frequently used as a surrogate…
In many applications that require matrix solutions of minimal rank, the underlying cost function is non-convex leading to an intractable, NP-hard optimization problem. Consequently, the convex nuclear norm is frequently used as a surrogate…
We establish a microscopic convexity principle for nonlinear elliptic and parabolic partial differential equations in general form.
The constant rank constraint qualification, introduced by Janin in 1984 for nonlinear programming, has been extensively used for sensitivity analysis, global convergence of first- and second-order algorithms, and for computing the…
We establish a geometric lower bound for the principal curvature of the level surfaces of solutions to $F(D^2u, Du, u, x)=0$ in convex ring domains, under a refined structural condition introduced by Bianchini-Longinetti-Salani in…
Based on the concepts of a generalized critical point and the corresponding generalized P.S. condition introduced by Duong Minh Duc[1], we have proved a new $Z_2$ index theorem and get a result on multiplicity of generalized critical…
In 1990 Kechris and Louveau developed the theory of three very natural ranks on the Baire class $1$ functions. A rank is a function assigning countable ordinals to certain objects, typically measuring their complexity. We extend this theory…
This paper deals with a modifed iterative projection method for approximating a solution of hierarchical fixed point problems for nearly nonexpansive mappings. Some strong convergence theorems for the proposed method are presented under…
Convex rank tests are partitions of the symmetric group which have desirable geometric properties. The statistical tests defined by such partitions involve counting all permutations in the equivalence classes. Each class consists of the…
The aim of the paper is twofold. Firstly, by using the constant rank level set theorem from differential geometry, we establish sharp upper bounds for the dimensions of the solution sets of polynomial variational inequalities under mild…
A branch of generalizations of the Banach Fixed Point Theorem replaces contractivity by a weaker but still effective property. The aim of the present note is to extend the contraction principle in this spirit for such complete semimetric…
We prove the global-in-time existence of nonnegative weak solutions to a class of fourth order partial differential equations on a convex bounded domain in arbitrary spatial dimensions. Our proof relies on the formal gradient flow structure…
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding, etc. As this problem is NP-hard in general, its convex relaxation, the nuclear norm minimization…
An important consequence of the Hahn-Banach Theorem says that on any locally convex Hausdorff topological space $X$, there are sufficiently many continuous linear functionals to separate points of $X$. In the paper, we establish a `local'…
The Ran-Reurings fixed point theorem [Proc. Amer. Math. Soc., 132 (2004), 1435-1443] is but a particular case of Maia's [Rend. Sem. Mat. Univ. Padova, 40 (1968), 139-143]. A "functional" version of this last result is then provided, in a…
A Riemannian gradient descent algorithm and a truncated variant are presented to solve systems of phaseless equations $|Ax|^2=y$. The algorithms are developed by exploiting the inherent low rank structure of the problem based on the…
The study of convex functions - in particular, of their optimization (really minimization) is one of the most important fields of applied mathematics. Convexity seems to be one of those incredibly well-chosen hypotheses which is just…
The aim of this article is to establish new two-functions minimax inequalities extending classical results such as Simons' minimax theorem. Our results will be proved in a non-compact setting. We also prove, under general conditions, that…