Numerical methods for solving some matrix feasibility problems (Q509640): Difference between revisions

The authors design two numerical methods for solving some matrix feasibility problems, which arise in the quantum information science. Numerical examples are given to show that the new methods are feasible and effective.

0 references

reviewed by

Hans Benker

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

matrix feasibility problems

0 references

quantum information

0 references

numerical examples

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s11075-016-0155-2

0 references

OpenAlex ID

W2417840606

0 references

cites work

Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces

0 references

On Projection Algorithms for Solving Convex Feasibility Problems

0 references

On the convergence of von Neumann's alternating projection algorithm for two sets

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

Extrapolation algorithm for affine-convex feasibility problems

0 references

Q3739782

0 references

Q5517433

0 references

Proximity Maps for Convex Sets

0 references

Steered sequential projections for the inconsistent convex feasibility problem

0 references

Equality relating Euclidean distance cone to positive semidefinite cone

0 references

How good are projection methods for convex feasibility problems?

0 references

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

0 references

Optimization and dynamical systems

0 references

Computing a nearest symmetric positive semidefinite matrix

0 references

One-Qubit Reduced States of a Pure Many-Qubit State: Polygon Inequalities

0 references

Q2926741

0 references

Alternating Projections on Manifolds

0 references

A non-interior continuation algorithm for solving the convex feasibility problem

0 references

Inequalities: theory of majorization and its applications

0 references

A relaxed alternating CQ-algorithm for convex feasibility problems

0 references

Q2706552

0 references

A simultaneous projections method for linear inequalities

0 references

On extremal quantum states of composite systems with fixed marginals

0 references

Regularization Methods for Semidefinite Programming

0 references

Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem

0 references

On rank-constrained Hermitian nonnegative-definite least squares solutions to the matrix equationAXAH=B

0 references

Subgradient projection algorithms for convex feasibility problems in the presence of computational errors

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:509640

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11075-016-0155-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2417840606
@@ Property / OpenAlex ID: W2417840606 / rank @@
+Normal rank
@@ Property / cites work @@
+Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
+Normal rank
@@ Property / cites work @@
+On Projection Algorithms for Solving Convex Feasibility Problems
+Normal rank
@@ Property / cites work @@
+On the convergence of von Neumann's alternating projection algorithm for two sets
+Normal rank
@@ Property / cites work @@
+Convex analysis and monotone operator theory in Hilbert spaces
+Normal rank
@@ Property / cites work @@
+Extrapolation algorithm for affine-convex feasibility problems
+Normal rank
@@ Property / cites work @@
+Q3739782
@@ Property / cites work: Q3739782 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5517433
@@ Property / cites work: Q5517433 / rank @@
+Normal rank
@@ Property / cites work @@
+Proximity Maps for Convex Sets
@@ Property / cites work: Proximity Maps for Convex Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Steered sequential projections for the inconsistent convex feasibility problem
+Normal rank
@@ Property / cites work @@
+Equality relating Euclidean distance cone to positive semidefinite cone
+Normal rank
@@ Property / cites work @@
+How good are projection methods for convex feasibility problems?
+Normal rank
@@ Property / cites work @@
+The method of projections for finding the common point of convex sets
+Normal rank
@@ Property / cites work @@
+Optimization and dynamical systems
@@ Property / cites work: Optimization and dynamical systems / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a nearest symmetric positive semidefinite matrix
+Normal rank
@@ Property / cites work @@
+One-Qubit Reduced States of a Pure Many-Qubit State: Polygon Inequalities
+Normal rank
@@ Property / cites work @@
+Q2926741
@@ Property / cites work: Q2926741 / rank @@
+Normal rank
@@ Property / cites work @@
+Alternating Projections on Manifolds
@@ Property / cites work: Alternating Projections on Manifolds / rank @@
+Normal rank
@@ Property / cites work @@
+A non-interior continuation algorithm for solving the convex feasibility problem
+Normal rank
@@ Property / cites work @@
+Inequalities: theory of majorization and its applications
+Normal rank
@@ Property / cites work @@
+A relaxed alternating CQ-algorithm for convex feasibility problems
+Normal rank
@@ Property / cites work @@
+Q2706552
@@ Property / cites work: Q2706552 / rank @@
+Normal rank
@@ Property / cites work @@
+A simultaneous projections method for linear inequalities
+Normal rank
@@ Property / cites work @@
+On extremal quantum states of composite systems with fixed marginals
+Normal rank
@@ Property / cites work @@
+Regularization Methods for Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
+Normal rank
@@ Property / cites work @@
+On rank-constrained Hermitian nonnegative-definite least squares solutions to the matrix equation<i>AXA</i><sup><i>H</i></sup>=<i>B</i>
+Normal rank
@@ Property / cites work @@
+Subgradient projection algorithms for convex feasibility problems in the presence of computational errors
+Normal rank