Results 1  10
of
12,805
On Projection Algorithms for Solving Convex Feasibility Problems
, 1996
"... Due to their extraordinary utility and broad applicability in many areas of classical mathematics and modern physical sciences (most notably, computerized tomography), algorithms for solving convex feasibility problems continue to receive great attention. To unify, generalize, and review some of the ..."
Abstract

Cited by 331 (43 self)
 Add to MetaCart
of these algorithms, a very broad and flexible framework is investigated . Several crucial new concepts which allow a systematic discussion of questions on behaviour in general Hilbert spaces and on the quality of convergence are brought out. Numerous examples are given. 1991 M.R. Subject Classification. Primary 47H
Equilibrium programming in Hilbert spaces
 2005), 117–136. CONVERGENCE THEOREMS FOR EP FIX 91
"... Several methods for solving systems of equilibrium problems in Hilbert spaces – and for finding best approximations thereof – are presented and their convergence properties are established. The proposed methods include proximallike blockiterative algorithms for general systems, as well as regular ..."
Abstract

Cited by 89 (4 self)
 Add to MetaCart
Several methods for solving systems of equilibrium problems in Hilbert spaces – and for finding best approximations thereof – are presented and their convergence properties are established. The proposed methods include proximallike blockiterative algorithms for general systems, as well
The Hilbert problems and Hilbert’s Program
, 2008
"... In 1900 the great mathematician David Hilbert laid down a list of 23 mathematical problems [32] which exercised a great influence on subsequent mathematical research. From the perspective of foundational studies, it is noteworthy that Hilbert’s Problems 1 and 2 are squarely in the area of foundation ..."
Abstract
 Add to MetaCart
In 1900 the great mathematician David Hilbert laid down a list of 23 mathematical problems [32] which exercised a great influence on subsequent mathematical research. From the perspective of foundational studies, it is noteworthy that Hilbert’s Problems 1 and 2 are squarely in the area
Hilbert’s Program Then and Now
, 2005
"... Hilbert’s program is, in the first instance, a proposal and a research program in the philosophy and foundations of mathematics. It was formulated in the early 1920s by German mathematician David Hilbert (1862–1943), and was pursued by him and his collaborators at the University of Göttingen and els ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Hilbert’s program is, in the first instance, a proposal and a research program in the philosophy and foundations of mathematics. It was formulated in the early 1920s by German mathematician David Hilbert (1862–1943), and was pursued by him and his collaborators at the University of Göttingen
HILBERT’S PROGRAM REVISITED
, 2003
"... After sketching the main lines of Hilbert’s program, certain wellknown and influential interpretations of the program are critically evaluated, and an alternative interpretation is presented. Finally, some recent developments in logic related to Hilbert’s program are reviewed. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
After sketching the main lines of Hilbert’s program, certain wellknown and influential interpretations of the program are critically evaluated, and an alternative interpretation is presented. Finally, some recent developments in logic related to Hilbert’s program are reviewed.
Derived Hilbert schemes
 J. A.M.S
"... (0.1) The Derived Deformation Theory (DDT) program (see [Kon], [CK] for more details and historical references) seeks to avoid the difficulties related to the singular nature of the moduli spaces in geometry by “passing to the derived category”, i.e., developing an appropriate version of the (nonabe ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
(0.1) The Derived Deformation Theory (DDT) program (see [Kon], [CK] for more details and historical references) seeks to avoid the difficulties related to the singular nature of the moduli spaces in geometry by “passing to the derived category”, i.e., developing an appropriate version
Hilbert's Programs: 19171922
, 1999
"... . Hilbert's finitist programwas not created at the beginning of the twenties solely to counteract Brouwer's intuitionism, but rather emerged out of broad philosophical reflections on the foundations of mathematics and out of detailed logical work; that is evident from notes of lecture c ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
. Hilbert's finitist programwas not created at the beginning of the twenties solely to counteract Brouwer's intuitionism, but rather emerged out of broad philosophical reflections on the foundations of mathematics and out of detailed logical work; that is evident from notes of lecture
The Design of Approximate Hilbert Transform Pairs of Wavelet Bases
, 2002
"... Several authors have demonstrated that significant improvements can be obtained in waveletbased signal processing by utilizing a pair of wavelet transforms where the wavelets form a Hilbert transform pair. This paper describes design procedures, based on spectral factorization, for the design of p ..."
Abstract

Cited by 55 (9 self)
 Add to MetaCart
Several authors have demonstrated that significant improvements can be obtained in waveletbased signal processing by utilizing a pair of wavelet transforms where the wavelets form a Hilbert transform pair. This paper describes design procedures, based on spectral factorization, for the design
HILBERT BASES FOR ORTHOGONAL ARRAYS
, 2006
"... Abstract. In this paper, we relate the problem of generating all 2level orthogonal arrays of given dimension and force, i.e. elements in OA(n, m), where n is the number of factors and m the force, to the solution of an Integer Programming problem involving rational convex cones. We do not restrict ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Abstract. In this paper, we relate the problem of generating all 2level orthogonal arrays of given dimension and force, i.e. elements in OA(n, m), where n is the number of factors and m the force, to the solution of an Integer Programming problem involving rational convex cones. We do not restrict
Results 1  10
of
12,805