scispace - formally typeset
Search or ask a question
Topic

Hilbert space

About: Hilbert space is a research topic. Over the lifetime, 29705 publications have been published within this topic receiving 637043 citations.


Papers
More filters
Book
26 Apr 2011
TL;DR: This book provides a largely self-contained account of the main results of convex analysis and optimization in Hilbert space, and a concise exposition of related constructive fixed point theory that allows for a wide range of algorithms to construct solutions to problems in optimization, equilibrium theory, monotone inclusions, variational inequalities, and convex feasibility.
Abstract: This book provides a largely self-contained account of the main results of convex analysis and optimization in Hilbert space. A concise exposition of related constructive fixed point theory is presented, that allows for a wide range of algorithms to construct solutions to problems in optimization, equilibrium theory, monotone inclusions, variational inequalities, best approximation theory, and convex feasibility. The book is accessible to a broad audience, and reaches out in particular to applied scientists and engineers, to whom these tools have become indispensable.

3,905 citations

Book
01 Jan 1948
TL;DR: The theory of semi-groups has been studied extensively in the literature, see as discussed by the authors for a survey of some of the main applications of semi groups in the context of functional analysis.
Abstract: Part One. Functional Analysis: Abstract spaces Linear transformations Vector-valued functions Banach algebras General properties Analysis in a Banach algebra Laplace integrals and binomial series Part Two. Basic Properties of Semi-Groups: Subadditive functions Semi-modules Addition theorem in a Banach algebra Semi-groups in the strong topology Generator and resolvent Generation of semi-groups Part Three. Advanced Analytical Theory of Semi-Groups: Perturbation theory Adjoint theory Operational calculus Spectral theory Holomorphic semi-groups Applications to ergodic theory Part Four. Special Semi-groups and Applications: Translations and powers Trigonometric semi-groups Semi-groups in $L_p(-\infty,\infty)$ Semi-groups in Hilbert space Miscellaneous applications Part Five. Extensions of the theory: Notes on Banach algebras Lie semi-groups Functions on vectors to vectors Bibliography Index.

3,462 citations

Book
23 Jun 1995
TL;DR: This book presents Semigroup Theory, a treatment of systems theory concepts in finite dimensions with a focus on Hankel Operators and the Nehari Problem.
Abstract: 1 Introduction.- 1.1 Motivation.- 1.2 Systems theory concepts in finite dimensions.- 1.3 Aims of this book.- 2 Semigroup Theory.- 2.1 Strongly continuous semigroups.- 2.2 Contraction and dual semigroups.- 2.3 Riesz-spectral operators.- 2.4 Delay equations.- 2.5 Invariant subspaces.- 2.6 Exercises.- 2.7 Notes and references.- 3 The Cauchy Problem.- 3.1 The abstract Cauchy problem.- 3.2 Perturbations and composite systems.- 3.3 Boundary control systems.- 3.4 Exercises.- 3.5 Notes and references.- 4 Inputs and Outputs.- 4.1 Controllability and observability.- 4.2 Tests for approximate controllability and observability.- 4.3 Input-output maps.- 4.4 Exercises.- 4.5 Notes and references.- 5 Stability, Stabilizability, and Detectability.- 5.1 Exponential stability.- 5.2 Exponential stabilizability and detectability.- 5.3 Compensator design.- 5.4 Exercises.- 5.5 Notes and references.- 6 Linear Quadratic Optimal Control.- 6.1 The problem on a finite-time interval.- 6.2 The problem on the infinite-time interval.- 6.3 Exercises.- 6.4 Notes and references.- 7 Frequency-Domain Descriptions.- 7.1 The Callier-Desoer class of scalar transfer functions.- 7.2 The multivariable extension.- 7.3 State-space interpretations.- 7.4 Exercises.- 7.5 Notes and references.- 8 Hankel Operators and the Nehari Problem.- 8.1 Frequency-domain formulation.- 8.2 Hankel operators in the time domain.- 8.3The Nehari extension problem for state linear systems.- 8.4 Exercises.- 8.5 Notes and references.- 9 Robust Finite-Dimensional Controller Synthesis.- 9.1 Closed-loop stability and coprime factorizations.- 9.2 Robust stabilization of uncertain systems.- 9.3 Robust stabilization under additive uncertainty.- 9.4 Robust stabilization under normalized left-coprime-factor uncertainty.- 9.5 Robustness in the presence of small delays.- 9.6 Exercises.- 9.7 Notes and references.- A. Mathematical Background.- A.1 Complex analysis.- A.2 Normed linear spaces.- A.2.1 General theory.- A.2.2 Hilbert spaces.- A.3 Operators on normed linear spaces.- A.3.1 General theory.- A.3.2 Operators on Hilbert spaces.- A.4 Spectral theory.- A.4.1 General spectral theory.- A.4.2 Spectral theory for compact normal operators.- A.5 Integration and differentiation theory.- A.5.1 Integration theory.- A.5.2 Differentiation theory.- A.6 Frequency-domain spaces.- A.6.1 Laplace and Fourier transforms.- A.6.2 Frequency-domain spaces.- A.6.3 The Hardy spaces.- A.7 Algebraic concepts.- A.7.1 General definitions.- A.7.2 Coprime factorizations over principal ideal domains.- A.7.3 Coprime factorizations over commutative integral domains.- References.- Notation.

2,923 citations

Journal ArticleDOI
TL;DR: This paper shows, by means of an operator called asplitting operator, that the Douglas—Rachford splitting method for finding a zero of the sum of two monotone operators is a special case of the proximal point algorithm, which allows the unification and generalization of a variety of convex programming algorithms.
Abstract: This paper shows, by means of an operator called asplitting operator, that the Douglas--Rachford splitting method for finding a zero of the sum of two monotone operators is a special case of the proximal point algorithm. Therefore, applications of Douglas--Rachford splitting, such as the alternating direction method of multipliers for convex programming decomposition, are also special cases of the proximal point algorithm. This observation allows the unification and generalization of a variety of convex programming algorithms. By introducing a modified version of the proximal point algorithm, we derive a new,generalized alternating direction method of multipliers for convex programming. Advances of this sort illustrate the power and generality gained by adopting monotone operator theory as a conceptual framework.

2,913 citations


Network Information
Related Topics (5)
Eigenvalues and eigenvectors
51.7K papers, 1.1M citations
92% related
Bounded function
77.2K papers, 1.3M citations
90% related
Differential equation
88K papers, 2M citations
89% related
Partial differential equation
70.8K papers, 1.6M citations
88% related
Invariant (mathematics)
48.4K papers, 861.9K citations
88% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023921
20221,946
20211,501
20201,521
20191,366
20181,322