Sufficient convexity and best approximation

Working constructively throughout, we introduce the notion of sufficient convexity for functions and sets and study its implications on the existence of best approximations of points in sets and of sets mutually.

Authors

Institutions

Publication Details

Journal
Documenta Mathematica
Published
2024-11-26
DOI
https://doi.org/10.4171/dm/985
Primary Topic
Constraint Satisfaction and Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Sufficient convexity and best approximation

Gregor Svindland, Douglas Bridges, Josef Berger
Documenta Mathematica
Constraint Satisfaction and Optimization
article

Sufficient convexity and best approximation

Gregor Svindland, Douglas Bridges, Josef Berger
article en

Abstract

Working constructively throughout, we introduce the notion of sufficient convexity for functions and sets and study its implications on the existence of best approximations of points in sets and of sets mutually.

Documenta MathematicaVol. 29(6)
Leibniz University Hannover (DE), University of Canterbury (NZ), Ludwig-Maximilians-Universität München (DE)
Openalex Percentile: Top 76%
Constraint Satisfaction and Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.