Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. (Q1421503): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jat.2003.08.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2148951975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior points algorithm for the convex feasibility problem / 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: Dykstra's alternating projection algorithm for two sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Projection Algorithms for Solving Convex Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4347616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of best Bregman approximations in reflexive Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dykstras algorithm with bregman projections: A convergence proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3739782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5580053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative row-action method for interval convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4397761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding projections onto the intersection of convex sets in hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best approximation in inner product spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case / 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: An iterative procedure for obtaining I-projections onto the intersection of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Outer Approximation Algorithm for Solving General Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxed projection method for variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cyclic projection algorithm via duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A successive projection method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Algorithm for a Class of Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two generalizations of Dykstra's cyclic projections algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simultaneous Iterative Method for Computing Projections on Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of Han's method for convex programming with quadratic objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: A row-action method for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual row-action method for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Hildreth’s Row-Action Method for Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4115737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition through formalization in a product space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual coordinate ascent methods for non-strictly convex minimization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:19, 6 June 2024

scientific article
Language Label Description Also known as
English
Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
scientific article

    Statements

    Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 January 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    Convex set
    0 references
    Dykstra's algorithm
    0 references
    Half-space
    0 references
    Projection
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references