Related papers: Construction of a CPA contraction metric for perio…
Composite minimization is a powerful framework in large-scale convex optimization, based on decoupling of the objective function into terms with structurally different properties and allowing for more flexible algorithmic design. We…
We propose a globally convergent numerical method to compute solutions to a general class of quasi-linear PDEs with both Neumann and Dirichlet boundary conditions. Combining the quasi-reversibility method and a suitable Carleman weight…
The random phase approximation (RPA) to the correlation energy is extended to fractional occupations and its performance examined for exact conditions on fractional charges and fractional spins. RPA satisfies the constancy condition for…
In the Euclidean setting, the proximal gradient method and its accelerated variants are a class of efficient algorithms for optimization problems with decomposable objective. In this paper, we develop a Riemannian proximal gradient method…
In this paper a compact Riemannian manifold with strictly convex boundary is reconstructed from its partial travel time data. This data assumes that an open measurement region on the boundary is given, and that for every point in the…
Let $S$ be the 2-sphere and $V \subset S$ be a finite set of at least three points. We show that for each function $\kappa: V \rightarrow (0, 2\pi)$ satisfying elementary necessary conditions, in each discrete conformal class of spherical…
In this paper decomposition of periodic orbits in bifurcation diagrams are derived in unidimensional dynamics system $x_{n+1}=f(x_{n};r)$, being $f$ an unimodal function. We proof a theorem which states the necessary and sufficient…
Why is it that semidefinite relaxations have been so successful in numerous applications in computer vision and robotics for solving non-convex optimization problems involving rotations? In studying the empirical performance we note that…
We analyzed the performance of a biologically inspired algorithm called the Corrected Projections Algorithm (CPA) when a sparseness constraint is required to unambiguously reconstruct an observed signal using atoms from an overcomplete…
To a generalized tight continuous frame in a Hilbert space $\H$ indexed by a locally compact space $\Si$ endowed with a Radon measure, one associates a coorbit theory converting spaces of functions on $\Si$ in spaces of vectors comparable…
We investigate the relationship between algorithmic fractal dimensions and the classical local fractal dimensions of outer measures in Euclidean spaces. We introduce global and local optimality conditions for lower semicomputable outer…
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…
The (pseudo-)Riemann-metrizability and Ricci-flatness of Finsler spaces with $m$-Kropina metric $F = \alpha^{1+m}\beta^{-m}$ of Berwald type are investigated. We prove that the affine connection on $F$ can locally be understood as the…
We have extended the spectral dynamics formalism introduced by Binney & Spergel, and have implemented a semi-analytic method to represent regular orbits in any potential, making full use of their regularity. We use the spectral analysis…
This paper defines fair principal component analysis (PCA) as minimizing the maximum mean discrepancy (MMD) between dimensionality-reduced conditional distributions of different protected classes. The incorporation of MMD naturally leads to…
We study the ergodic optimization problem over a real analytic expanding circle map. We show that in both the topological and the measure-theoretical senses, a typical $C^r$ performance function has a unique maximizing measure and the…
For any partial combinatory algebra (PCA for short) A, the class of A-representable partial functions from N to A quotiented by the filter of cofinite sets of N, is a PCA such that the representable partial functions are exactly the…
We calculate numerically the periodic orbits of pseudointegrable systems of low genus numbers $g$ that arise from rectangular systems with one or two salient corners. From the periodic orbits, we calculate the spectral rigidity…
We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for…
We consider the following eigenvalue optimization in the composite membrane problem with fractional Laplacian: given a bounded domain $\Omega\subset \mathbb{R}^n$, $\alpha>0$ and $0<A<|\Omega|$, find a subset $D\subset \Omega$ of area $A$…