On Projection Algorithms for Solving Convex Feasibility Problems

SIAM Review - United States
doi 10.1137/s0036144593251710
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

The Combination Projection Method for Solving Convex Feasibility Problems

Mathematics
Mathematics
2018English

On Long-Step Surrogate Projection Methods for Solving Convex Feasibility Problems

1996English

Simultaneous and Semi-Alternating Projection Algorithms for Solving Split Equality Problems

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2018English

Hybrid Gradient-Projection Algorithm for Solving Constrained Convex Minimization Problems With Generalized Mixed Equilibrium Problems

Journal of Function Spaces and Applications
2012English

Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1995English

First-Order Convex Feasibility Algorithms for X-Ray CT

Medical Physics
MedicineNuclear MedicineRadiologyImagingBiophysics
2013English

On Solving of Constrained Convex Minimize Problem Using Gradient Projection Method

International Journal of Mathematics and Mathematical Sciences
Mathematics
2018English

Algorithms for Solving Non-Linear Programming Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1975English

Evolutionary Algorithms for Solving Quasi Geometric Programming Problems

2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy