Finding a best approximation pair of points for two polyhedra (Q1616942): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q129490742, #quickstatements; #temporary_batch_1724796091478
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Successive projections on hyperplanes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of von Neumann's alternating projection algorithm for two sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dykstra's alternating projection algorithm for two sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and monotone operator theory in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding best approximation pairs relative to two closed convex sets in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5432585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative methods for fixed point problems in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational acceleration of projection algorithms for the linear best approximation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection methods: an annotated bibliography of books and reviews / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity Maps for Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best approximation in inner product spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Restricted Least Squares Regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3172946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4825209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed points of nonexpanding maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on alternating projections in Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On products of projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of fixed points of nonexpansive mappings / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129490742 / rank
 
Normal rank

Latest revision as of 23:08, 27 August 2024

scientific article
Language Label Description Also known as
English
Finding a best approximation pair of points for two polyhedra
scientific article

    Statements

    Finding a best approximation pair of points for two polyhedra (English)
    0 references
    0 references
    0 references
    0 references
    7 November 2018
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references