Relaxed outer projections, weighted averages and convex feasibility (Q751771): Difference between revisions

This paper considers the problem of finding a common point of finitely many closed nonconvex sets. A new projection-type algorithm is proposed which may be useful for very large-scale problems. Theoretical results are provided but no computational experience.

0 references

zbMATH Keywords

relaxed outer projections

0 references

weighted averages

0 references

convex feasibility

0 references

projection method

0 references

common point of finitely many closed nonconvex sets

0 references

large-scale problems

0 references

reviewed by

Thomas F. Coleman

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

The Relaxation Method for Linear Inequalities

0 references

Block-iterative projection methods for parallel computation of solutions to convex feasibility problems

0 references

Row-Action Methods for Huge and Sparse Systems and Their Applications

0 references

Q3688107

0 references

Cyclic subgradient projections

0 references

Parallel application of block-iterative methods in medical imaging and radiation therapy

0 references

The Relaxation Method for Solving Systems of Linear Inequalities

0 references

Q4190446

0 references

The method of projections for finding the common point of convex sets

0 references

Convergence results for an accelerated nonlinear Cimmino algorithm

0 references

A Simultaneous Iterative Method for Computing Projections on Polyhedra

0 references

Q5768822

0 references

Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equations

0 references

The Relaxation Method for Linear Inequalities

0 references

Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints

0 references

Decomposition through formalization in a product space

0 references

A simultaneous projections method for linear inequalities

0 references

A finitely convergent ``row-action'' method for the convex feasibility problem

0 references

Q3223439

0 references

A primal-dual projection method for solving systems of linear inequalities

0 references

full work available at URL

https://doi.org/10.1007/bf02017349

0 references

Identifiers

zbMATH Open document ID

0715.65038

0 references

DOI

10.1007/BF02017349

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:751771

@@ Property / cites work @@
+The Relaxation Method for Linear Inequalities
@@ Property / cites work: The Relaxation Method for Linear Inequalities / rank @@
+Normal rank
@@ Property / cites work @@
+Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
+Normal rank
@@ Property / cites work @@
+Row-Action Methods for Huge and Sparse Systems and Their Applications
+Normal rank
@@ Property / cites work @@
+Q3688107
@@ Property / cites work: Q3688107 / rank @@
+Normal rank
@@ Property / cites work @@
+Cyclic subgradient projections
@@ Property / cites work: Cyclic subgradient projections / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel application of block-iterative methods in medical imaging and radiation therapy
+Normal rank
@@ Property / cites work @@
+The Relaxation Method for Solving Systems of Linear Inequalities
+Normal rank
@@ Property / cites work @@
+Q4190446
@@ Property / cites work: Q4190446 / rank @@
+Normal rank
@@ Property / cites work @@
+The method of projections for finding the common point of convex sets
+Normal rank
@@ Property / cites work @@
+Convergence results for an accelerated nonlinear Cimmino algorithm
+Normal rank
@@ Property / cites work @@
+A Simultaneous Iterative Method for Computing Projections on Polyhedra
+Normal rank
@@ Property / cites work @@
+Q5768822
@@ Property / cites work: Q5768822 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equations
+Normal rank
@@ Property / cites work @@
+The Relaxation Method for Linear Inequalities
@@ Property / cites work: The Relaxation Method for Linear Inequalities / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints
+Normal rank
@@ Property / cites work @@
+Decomposition through formalization in a product space
+Normal rank
@@ Property / cites work @@
+A simultaneous projections method for linear inequalities
+Normal rank
@@ Property / cites work @@
+A finitely convergent ``row-action'' method for the convex feasibility problem
+Normal rank
@@ Property / cites work @@
+Q3223439
@@ Property / cites work: Q3223439 / rank @@
+Normal rank
@@ Property / cites work @@
+A primal-dual projection method for solving systems of linear inequalities
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02017349
+Normal rank
@@ Property / OpenAlex ID @@
+W1971915361
@@ Property / OpenAlex ID: W1971915361 / rank @@
+Normal rank