UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Convex Analysis and Monotone Operator Theory in Hilbert Spaces

2017

Volltextzugriff (PDF)

A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications

Mathematics of operations research, 2017-05, Vol.42 (2), p.330-348

2017

Volltextzugriff (PDF)

On Linear Convergence of Non-Euclidean Gradient Methods without Strong Convexity and Lipschitz Gradient Continuity

Journal of optimization theory and applications, 2019-09, Vol.182 (3), p.1068-1087

2019

Volltextzugriff (PDF)

Phase retrieval, error reduction algorithm, and Fienup variants: a view from convex optimization

Journal of the Optical Society of America. A, Optics, image science, and vision, 2002-07, Vol.19 (7), p.1334

2002

Volltextzugriff (PDF)

On the local convergence of the Douglas–Rachford algorithm

Archiv der Mathematik, 2014-06, Vol.102 (6), p.589-600

2014

Volltextzugriff (PDF)

Projection and proximal point methods: convergence results and counterexamples

Nonlinear analysis, 2004-02, Vol.56 (5), p.715-738

2004

Volltextzugriff (PDF)

Projecting onto rectangular matrices with prescribed row and column sums

Fixed point theory and algorithms for sciences and engineering, 2021-12, Vol.2021 (1), p.1-20, Article 23

2021

Volltextzugriff (PDF)

A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces

Mathematics of operations research, 2001-05, Vol.26 (2), p.248-264

2001

Volltextzugriff (PDF)

On Slater’s condition and finite convergence of the Douglas–Rachford algorithm for solving convex feasibility problems in Euclidean spaces

Journal of global optimization, 2016-06, Vol.65 (2), p.329-349

2016

Volltextzugriff (PDF)

Roots of the identity operator and proximal mappings: (Classical and phantom) cycles and gap vectors

Proceedings of the American Mathematical Society, 2022-12, Vol.150 (12), p.5383

2022

Volltextzugriff (PDF)

Generalized monotone operators and their averaged resolvents

Mathematical programming, 2021-09, Vol.189 (1-2), p.55-74

2021

Volltextzugriff (PDF)

On Projection Algorithms for Solving Convex Feasibility Problems

SIAM review, 1996-09, Vol.38 (3), p.367-426

1996

Volltextzugriff (PDF)

Hybrid projection–reflection method for phase retrieval

Journal of the Optical Society of America. A, Optics, image science, and vision, 2003-06, Vol.20 (6), p.1025

2003

Volltextzugriff (PDF)

On the Douglas–Rachford Algorithm for Solving Possibly Inconsistent Optimization Problems

Mathematics of operations research, 2024-02, Vol.49 (1), p.58-77

2024

Volltextzugriff (PDF)

On the Douglas–Rachford algorithm

Mathematical programming, 2017-07, Vol.164 (1-2), p.263-284

2017

Volltextzugriff (PDF)

On the linear convergence of circumcentered isometry methods

Numerical algorithms, 2021-05, Vol.87 (1), p.263-297

2021

Volltextzugriff (PDF)

The Approximation of Fixed Points of Compositions of Nonexpansive Mappings in Hilbert Space

Journal of mathematical analysis and applications, 1996-08, Vol.202 (1), p.150-159

Bauschke, Heinz H.

1996

Volltextzugriff (PDF)

Best approximation mappings in Hilbert spaces

Mathematical programming, 2022-09, Vol.195 (1-2), p.855-901

2022

Volltextzugriff (PDF)

The kernel average for two convex functions and its application to the extension and representation of monotone operators

Transactions of the American Mathematical Society, 2009-11, Vol.361 (11), p.5947-5965

2009

Volltextzugriff (PDF)

Splitting Algorithms, Modern Operator Theory, and Applications

1st ed. 2019., 2019

Volltextzugriff (PDF)

Maximally monotone operators with ranges whose closures are not convex and an answer to a recent question by Stephen Simons

Proceedings of the American Mathematical Society, 2020-05, Vol.148 (5), p.2035-2044

2020

Volltextzugriff (PDF)

Bregman Monotone Optimization Algorithms

SIAM journal on control and optimization, 2003-01, Vol.42 (2), p.596-636

2003

Volltextzugriff (PDF)

On the convexity of piecewise-defined functions

ESAIM. Control, optimisation and calculus of variations, 2016-07, Vol.22 (3), p.728-742

2016

Volltextzugriff (PDF)

Projections onto hyperbolas or bilinear constraint sets in Hilbert spaces

Journal of global optimization, 2023-05, Vol.86 (1), p.25-36

2023

Volltextzugriff (PDF)

How to project onto the intersection of a closed affine subspace and a hyperplane

Mathematical methods of operations research (Heidelberg, Germany), 2024-10, Vol.100 (2), p.411-435

2024

Volltextzugriff (PDF)

1 – 25 von 372

Menü

Weitere Dienste

Einstellungen

Convex Analysis and Monotone Operator Theory in Hilbert Spaces

A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications

On Linear Convergence of Non-Euclidean Gradient Methods without Strong Convexity and Lipschitz Gradient Continuity

Phase retrieval, error reduction algorithm, and Fienup variants: a view from convex optimization

On the local convergence of the Douglas–Rachford algorithm

Projection and proximal point methods: convergence results and counterexamples

Projecting onto rectangular matrices with prescribed row and column sums

A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces

On Slater’s condition and finite convergence of the Douglas–Rachford algorithm for solving convex feasibility problems in Euclidean spaces

Roots of the identity operator and proximal mappings: (Classical and phantom) cycles and gap vectors

Generalized monotone operators and their averaged resolvents

On Projection Algorithms for Solving Convex Feasibility Problems

Hybrid projection–reflection method for phase retrieval

On the Douglas–Rachford Algorithm for Solving Possibly Inconsistent Optimization Problems

On the Douglas–Rachford algorithm

On the linear convergence of circumcentered isometry methods

The Approximation of Fixed Points of Compositions of Nonexpansive Mappings in Hilbert Space

Best approximation mappings in Hilbert spaces

The kernel average for two convex functions and its application to the extension and representation of monotone operators

Splitting Algorithms, Modern Operator Theory, and Applications

Maximally monotone operators with ranges whose closures are not convex and an answer to a recent question by Stephen Simons

Bregman Monotone Optimization Algorithms

On the convexity of piecewise-defined functions

Projections onto hyperbolas or bilinear constraint sets in Hilbert spaces

How to project onto the intersection of a closed affine subspace and a hyperplane

Suchergebnisse filtern