Related papers: Globally strongly convex cost functional for a coe…
This paper proposes novel approaches for designing control Lyapunov functions (CLFs) for constrained linear systems. We leverage recent configuration-constrained polyhedral computing techniques to devise piecewise affine convex CLFs.…
This paper gives a dichotomy theorem for the complexity of computing the partition function of an instance of a weighted Boolean constraint satisfaction problem. The problem is parameterised by a finite set F of non-negative functions that…
We review the emergence of hypergeometric structures (of $F_4$ Appell functions) from the conformal Ward identities (CWIs) in conformal field theories (CFTs) in dimensions $d > 2$. We illustrate the case of scalar 3- and 4-point functions.…
Considering the weighted concept of majorization, Sherman obtained generalization of majorization inequality for convex functions known as Sherman's inequality. We extend Sherman's result to the class of n-strongly convex functions using…
In this letter we revisit the famous heavy ball method and study its global convergence for a class of non-convex problems with sector-bounded gradient. We characterize the parameters that render the method globally convergent and yield the…
A 3-D inverse medium problem in the frequency domain is considered. Another name for this problem is Coefficient Inverse Problem. The goal is to reconstruct spatially distributed dielectric constants from scattering data. Potential…
Global radial basis function (RBF) collocation methods with inifinitely smooth basis functions for partial differential equations (PDEs) work in general geometries, and can have exponential convergence properties for smooth solution…
This is a survey, which is a continuation of the previous survey of the author about applications of Carleman estimates to Inverse Problems, J. Inverse and Ill-Posed Problems, 21, 477-560, 2013. It is shown here that Tikhonov functionals…
In this paper, we describe a new vector similarity measure associated with a convex cost function. Given two vectors, we determine the surface normals of the convex function at the vectors. The angle between the two surface normals is the…
In this article, we describe a function fitting method that has potential applications in machine learning and also prove relevant theorems. The described function fitting method is a convex minimization problem and can be solved using a…
We give curvature-dependant convergence rates for the optimization of weakly convex functions defined on a manifold of 1-bounded geometry via Riemannian gradient descent and via the dynamic trivialization algorithm. In order to do this, we…
Weighted cone-volume functionals are introduced for the convex polytopes in $\mathbb{R}^n$. For these functionals, geometric inequalities are proved and the equality conditions are characterized. A variety of corollaries are derived,…
Frank-Wolfe algorithm (FW) and its variants have gained a surge of interests in machine learning community due to its projection-free property. Recently people have reduced the gradient evaluation complexity of FW algorithm to…
In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…
We propose to combine the Carleman estimate and the Newton method to solve an inverse source problem for nonlinear parabolic equations from lateral boundary data. The stability of this inverse source problem is conditionally logarithmic.…
Higher order coefficients of the inverse mass expansion of one--loop effective actions are obtained from a one--dimensional path integral representation. For the evaluation of the path integral with Wick contractions a suitable Green…
In this paper, we establish a global Carleman estimate for an Ultrahyperbolic Schr\"odinger equation. Moreover, we prove H\"older stability for the inverse problem of determining a coefficient or a source term in the Ultrahyperbolic…
Inverse scattering problems of the reconstructions of physical properties of a medium from boundary measurements are substantially challenging ones. This work aims to verify the performance on experimental data of a newly developed…
With the development of robotics, there are growing needs for real time motion planning. However, due to obstacles in the environment, the planning problem is highly non-convex, which makes it difficult to achieve real time computation…
Symmetric quantum signal processing provides a parameterized representation of a real polynomial, which can be translated into an efficient quantum circuit for performing a wide range of computational tasks on quantum computers. For a given…