English
Related papers

Related papers: A note on the Moment Problem for codimension great…

200 papers

This paper gives a complete classification of linear repetitivity (LR) for a natural class of aperiodic Euclidean cut and project schemes with convex polytopal windows. Our results cover those cut and project schemes for which the lattice…

Dynamical Systems · Mathematics 2020-12-02 Henna Koivusalo , James J. Walton

We consider the popular and classical method of alternating projections for finding a point in the intersection of two closed sets. By situating the algorithm in a metric space, equipped only with well-behaved geodesics and angles (in the…

Optimization and Control · Mathematics 2022-06-10 Adrian S. Lewis , Genaro López-Acedo , Adriana Nicolae

We observe that the characteristic polynomial of a linearly perturbed semidefinite matrix can be used to give the convergence rate of alternating projections for the positive semidefinite cone and a line. As a consequence, we show that such…

Optimization and Control · Mathematics 2025-04-17 Hiroyuki Ochiai , Yoshiyuki Sekiguchi , Hayato Waki

A general elliptic $N\times N$ matrix Lax scheme is presented, leading to two classes of elliptic lattice systems, one which we interpret as the higher-rank analogue of the Landau-Lifschitz equations, while the other class we characterize…

Exactly Solvable and Integrable Systems · Physics 2015-06-19 N. Delice , F. W. Nijhoff , S. Yoo-Kong

We investigate the properties of the simultaneous projection method as applied to countably infinitely many closed and linear subspaces of a real Hilbert space. We establish the optimal error bound for linear convergence of this method,…

Optimization and Control · Mathematics 2021-08-31 Simeon Reich , Rafał Zalas

The discretization of least-squares problems for linear ill-posed operator equations in Hilbert spaces is considered. The main subject of this article concerns conditions for convergence of the associated discretized minimum-norm…

Numerical Analysis · Mathematics 2016-02-10 Stefan Kindermann

A lattice in the Euclidean space is standard if it has a basis consisting vectors whose norms equal to the length in its successive minima. In this paper, it is shown that with the $L^2$ norm all lattices of dimension $n$ are standard if…

Number Theory · Mathematics 2017-06-06 Rongquan Feng , Longke Tang , Kun Wang

The projection onto the intersection of sets generally does not allow for a closed form even when the individual projection operators have explicit descriptions. In this work, we systematically analyze the projection onto the intersection…

Optimization and Control · Mathematics 2018-04-16 Heinz H. Bauschke , Minh N. Bui , Xianfu Wang

We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point…

Optimization and Control · Mathematics 2020-03-26 D. Russell Luke , Marc Teboulle , Nguyen H. Thao

The von Neumann-Halperin method of alternating projections converges strongly to the projection of a given point onto the intersection of finitely many closed affine subspaces. We propose acceleration schemes making use of two ideas:…

Optimization and Control · Mathematics 2014-07-17 C. H. Jeffrey Pang

We propose an exact Hamiltonian lattice theory for (2+1)-dimensional spacetimes with homogeneous curvature. By gauging away the lattice we find a generalization of the ``polygon representation'' of (2+1)-dimensional gravity. We compute the…

General Relativity and Quantum Cosmology · Physics 2007-05-23 A. Criscuolo , H. Waelbroeck

A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints…

Combinatorics · Mathematics 2011-11-10 W. M. B. Dukes

We derive a closed-form expression for the projection onto a capped rotated second-order cone -- a convex set that arises in perspective relaxations of nonlinear programs with binary indicator variables. The closed-form solution involves…

Optimization and Control · Mathematics 2025-07-16 Noam Goldberg , Ishy Zagdoun

It is shown that, given any $k$-dimensional lattice $\Lambda$, there is a lattice sequence $\Lambda_w$, $w\in \mathbb Z$, with sub-orthogonal lattice $\Lambda_o \subset \Lambda$, converging to $\Lambda$ (unless equivalence), also we discuss…

Information Theory · Computer Science 2017-08-10 João Eloir Strapasson

For the truncated multidimensional moment problem we introduce a notion of a canonical solution. Namely, canonical solutions are those solutions which are generated by commuting self-adjoint extensions inside the associated Hilbert space.…

Classical Analysis and ODEs · Mathematics 2024-07-01 Sergey M. Zagorodnyuk

We study the metric projection onto the closed convex cone in a real Hilbert space $\mathscr{H}$ generated by a sequence $\mathcal{V} = \{v_n\}_{n=0}^\infty$. The first main result of this paper provides a sufficient condition under which…

Functional Analysis · Mathematics 2021-02-17 Yanqi Qiu , Zipeng Wang

A contractive condition is addressed for extended 2-cyclic self-mappings on the union of a finite number of subsets of a metric space which are allowed to have a finite number of successive images in the same subsets of its domain. It is…

Functional Analysis · Mathematics 2012-08-18 M. De La Sen

We denote by Conc(L) the semilattice of all finitely generated congruences of a lattice L. For varieties (i.e., equational classes) V and W of lattices such that V is contained neither in W nor its dual, and such that every simple member of…

Logic · Mathematics 2014-03-24 Pierre Gillibert

In this article we consider a consistent convex feasibility problem in a real Hilbert space defined by a finite family of sets $C_i$. We are interested, in particular, in the case where for each $i$, $C_i=Fix (U_i)=\{z\in \mathcal H\mid…

Optimization and Control · Mathematics 2017-03-29 Victor I. Kolobov , Simeon Reich , Rafał Zalas

We provide formulas for projectors onto a polyhedral set, i.e. the intersection of a finite number of halfspaces. To this aim we formulate the problem of finding the projection as a convex optimization problem and we solve explicitly…

Optimization and Control · Mathematics 2017-04-20 Krzysztof E. Rutkowski