Finding a best approximation pair of points for two polyhedra (Q1616942)

From MaRDI portal
Revision as of 22:51, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding a best approximation pair of points for two polyhedra
scientific article

    Statements

    title
    Finding a best approximation pair of points for two polyhedra (English)
    0 references
    author
    Ron Aharoni
    0 references
    Yair Censor
    0 references
    Zilin Jiang
    0 references
    publication date
    7 November 2018
    0 references
    zbMATH Keywords
    best approximation pair
    0 references
    convex polyhedra
    0 references
    alternating projections
    0 references
    half-spaces
    0 references
    Cheney-Goldstein theorem
    0 references
    Halpern-Lions-Wittmann-Bauschke algorithm
    0 references
    cites work
    Q5432585
    0 references
    Q4718793
    0 references
    Q3172946
    0 references
    Q4825209
    0 references
    Q4119693
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C20
    0 references
    90C25
    0 references
    65K05
    0 references
    zbMATH DE Number
    6974605
    0 references
    OpenAlex ID
    W3101963437
    0 references
    arXiv ID
    1707.09639
    0 references
    Wikidata QID
    Q129490742
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1616942&oldid=38667270"
    Powered by MediaWiki