Related papers: Regular Type III and Type N Approximate Solutions
There is a basic paradigm, called here the radius of well-posedness, which quantifies the "distance" from a given well-posed problem to the set of ill-posed problems of the same kind. In variational analysis, well-posedness is often…
A nearly linear recurrence sequence (nlrs) is a complex sequence $(a_n)$ with the property that there exist complex numbers $A_0$,$\ldots$, $A_{d-1}$ such that the sequence $\big(a_{n+d}+A_{d-1}a_{n+d-1}+\cdots +A_0a_n\big)_{n=0}^{\infty}$…
We establish new results of first-order necessary conditions of optimality for finite-dimensional problems with inequality constraints and for problems with equality and inequality constraints, in the form of John's theorem and in the form…
In this manuscript, we propose a general proximal quasi-Newton method tailored for nonconvex and nonsmooth optimization problems, where we do not require the sequence of the variable metric (or Hessian approximation) to be uniformly bounded…
Scalar curvature invariants are studied in type N solutions of vacuum Einstein's equations with in general non-vanishing cosmological constant Lambda. Zero-order invariants which include only the metric and Weyl (Riemann) tensor either…
This is a simplification of our prior work on the existence theory for the Rosseland-type equations. Inspired by the Rosseland equation in the conduction-radiation coupled heat transfer, we use the locally arbitrary growth conditions…
We prove a quantitative regularity theorem and blowup criterion for classical solutions of the three-dimensional Navier-Stokes equations satisfying certain critical conditions. The solutions we consider have $\|r^{1-\frac3q}u\|_{L_t^\infty…
Optimization problems with composite functions consist of an objective function which is the sum of a smooth and a (convex) nonsmooth term. This particular structure is exploited by the class of proximal gradient methods and some of their…
This thesis starts from a review on current research on the local hypoellipticity of the $\bar\partial$-Neumann problem. It presents the classical method of regularity from estimates of the energy: subelliptic as well as superlogarithmic.…
A classical 3-D thermoviscoelastic system of Kelvin-Voigt type is considered. The existence and uniqueness of a global regular solution is proved without small data assumption. The existence proof is based on the successive approximation…
Tensor completion is a natural higher-order generalization of matrix completion where the goal is to recover a low-rank tensor from sparse observations of its entries. Existing algorithms are either heuristic without provable guarantees,…
The numerical properties of algorithms for finding the intersection of sets depend to some extent on the regularity of the sets, but even more importantly on the regularity of the intersection. The alternating projection algorithm of von…
We study interior $\varepsilon$-regularity and Type I blowup criteria for suitable weak solutions to the three-dimensional incompressible MHD equations. Our starting point is a direct iteration scheme for the classical…
This paper presents strong worst-case iteration and operation complexity guarantees for Riemannian adaptive regularized Newton methods, a unified framework encompassing both Riemannian adaptive regularization (RAR) methods and Riemannian…
The subject of this paper is regularity-preserving aggregation of regular norms on finite-dimensional linear spaces. Regular norms were introduced in [5] and are closely related to ``type 2'' spaces [9, Chapter 9] playing important role in…
In this paper, we study the regularity criterion of weak solutions to the three-dimensional (3D) MHD equations. It is proved that the solution $(u,b)$ becomes regular provided that one velocity and one current density component of the…
We show that any $n\times m$ matrix $A$ can be approximated in operator norm by a submatrix with a number of columns of order the stable rank of $A$. This improves on existing results by removing an extra logarithmic factor in the size of…
In the present paper we propose two new algorithms of tensor completion for three-order tensors. The proposed methods consist in minimizing the average rank of the underlying tensor using its approximate function namely the tensor nuclear…
We propose and analyze a regularization approach for structured prediction problems. We characterize a large class of loss functions that allows to naturally embed structured outputs in a linear space. We exploit this fact to design…
This paper is devoted to find the numerical solutions of one dimensional general nonlinear system of third-order boundary value problems (BVPs) for the pair of functions using Galerkin weighted residual method. We derive mathematical…