The Combination Projection Method for Solving Convex Feasibility Problems

Mathematics - Switzerland
doi 10.3390/math6110249
Full Text
Abstract

Available in full text

Categories
Mathematics
Date
Authors
Publisher

MDPI AG

Related search

On Projection Algorithms for Solving Convex Feasibility Problems

SIAM Review
Computational MathematicsApplied MathematicsTheoretical Computer Science
1996English

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

1996English

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

On Solving of Constrained Convex Minimize Problem Using Gradient Projection Method

International Journal of Mathematics and Mathematical Sciences
Mathematics
2018English

Iterative Method for Solving the Linear Feasibility Problem

Journal of Optimization Theory and Applications
ControlManagement ScienceApplied MathematicsOptimizationOperations Research
2007English

Regularized Gradient-Projection Methods for Equilibrium and Constrained Convex Minimization Problems

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2013English

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

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2018English

A Modified Halpern's Iterative Scheme for Solving Split Feasibility Problems

Abstract and Applied Analysis
Applied MathematicsAnalysis
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy