The Method of Cyclic Intrepid Projections: Convergence Analysis and Numerical Experiments (Q3455009): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1312.0534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4179429 / 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: A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces / 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: Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3654591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / 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: Q4718793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient controls for finitely convergent sequential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbertian convex feasibility problem: Convergence of projection methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inherently parallel algorithms in feasibility and optimization and their applications. Research workshop, Haifa, Israel, March 13--16, 2000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving monotone inclusions via compositions of nonexpansive averaged operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxation method for reconstructing objects from noisy X-rays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computerized Tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternating projection that does not converge in norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Adaptive Projected Subgradient Method Constrained by Families of Quasi-nonexpansive Mappings and Its Application to Online Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings / rank
 
Normal rank

Latest revision as of 03:17, 11 July 2024

scientific article
Language Label Description Also known as
English
The Method of Cyclic Intrepid Projections: Convergence Analysis and Numerical Experiments
scientific article

    Statements

    The Method of Cyclic Intrepid Projections: Convergence Analysis and Numerical Experiments (English)
    0 references
    0 references
    0 references
    0 references
    3 December 2015
    0 references
    convex set
    0 references
    feasibility problem
    0 references
    halfspace
    0 references
    intrepid projection
    0 references
    linear inequalities
    0 references
    projection
    0 references
    road design
    0 references
    0 references
    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