Search
Search Results
-
An inexactly accelerated algorithm for nonnegative tensor CP decomposition with the column unit constraints
The component separation problem in complex chemical systems is very important and challenging in chemometrics. In this paper, we study a third-order...
-
An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems
A popular optimization model arising from image processing is the separable optimization problem whose objective function is the sum of three...
-
Horizontal Joinability on 5-Dimensional 2-Step Carnot Groups with a Codimension 2 Horizontal Distribution
For a 5-dimensional 2-step Carnot group G 3,2 with a codimension 2 horizontal distribution, we prove that any two points u , v ∈ G 3,2 can be joined on...
-
Tighter bound estimation for efficient biquadratic optimization over unit spheres
Bi-quadratic programming over unit spheres is a fundamental problem in quantum mechanics introduced by pioneer work of Einstein, Schrödinger, and...
-
A Note on the Heat Kernel for the Rescaled Harmonic Oscillator from Two Step Nilpotent Lie Groups
In this note, we use Schrödinger representations and the Fourier transform on two step nilpotent Lie groups to compute the explicit formula of the...
-
Bi-step Method for Variational Inequalities on Riemannian Manifold of Non-negative Constant Curvature
In this paper, we have proposed a bi-step method for solving variational inequalities on Riemannian manifold with the use of auxiliary principle...
-
An optimal pinching theorem of minimal Legendrian submanifolds in the unit sphere
In this paper, we study the rigidity theorem of closed minimally immersed Legendrian submanifolds in the unit sphere. Utilizing the maximum...
-
Sparse Moments of Univariate Step Functions and Allele Frequency Spectra
We study the univariate moment problem of piecewise-constant density functions on the interval [0,1] and its consequences for an inference problem in...
-
Single-step PMQHSS and new PMQHSS methods for complex symmetric linear systems with strongly dominant skew-Hermitian parts
In order to solve complex symmetric linear equations more stably and quickly, we design a single-step preconditioned MQHSS (SPMQHSS) iteration method...
-
Limit theory for the first layers of the random convex hull peeling in the unit ball
The convex hull peeling of a point set is obtained by taking the convex hull of the set and repeating iteratively the operation on the interior...
-
Operators on Function Spaces
This is a set of lecture notes to accompany a series of talks given as part of the Fields Institute session on Operators on Function Spaces from...
-
Uniqueness of Meromorphic Functions Sharing Small Functions Dealing with Multiple Values in One Angular Domain of the Unit Disc
In this paper we investigate the uniqueness of meromorphic functions that share five small functions dealing with multiple values in one angular...
-
The Green Function of the Navier Problem for the Polyharmonic Equation in a Ball
We introduce the notion of an elementary solution to the polyharmonic equation and study its properties. We derive the integral representation for...
-
Counterexample and an additional revealing poll step for a result of “analysis of direct searches for discontinuous functions”
This note provides a counterexample to a theorem announced in the last part of the paper (Vicente and Custódio Math Program 133:299–325, 2012). The...
-
-
Loss Function Dynamics and Landscape for Deep Neural Networks Trained with Quadratic Loss
AbstractKnowledge of the loss landscape geometry makes it possible to successfully explain the behavior of neural networks, the dynamics of their...
-
Small Cap Square Function Estimates
We introduce and prove small cap square function estimates for the unit parabola and the truncated light cone. More precisely, we study inequalities...
-
Fuzzy Similarity for Parallel Function Computation Model
We should consider a best search function computation model, not just expression-based function computation model, because if we use the best search...