Numerical methods for solving some matrix feasibility problems

DOI10.1007/S11075-016-0155-2zbMATH Open1359.65091OpenAlexW2417840606MaRDI QIDQ509640FDOQ509640

Authors: Xuefeng Duan, Chunmei Li, Jiaofen Li, Yong Ding 

Publication date: 17 February 2017

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-016-0155-2

Recommendations

• A numerical algorithm for solving a class of matrix equations
• Numerical methods in matrix computations
• Numerical methods for solving optimization problems with differential linear matrix inequalities
• On the numerical solution of differential linear matrix inequalities
• On the numerical solution of a class of systems of linear matrix equations
• Numerical solution of a class of quasi-linear matrix equations
• scientific article; zbMATH DE number 7395987
• On the numerical solution of matrix polynomial equations
• Numerical Methods for Nearly Singular Constrained Matrix Sylvester Equations
• Matrix pencils: Theory, applications, and numerical methods

zbMATH Keywords

numerical examplesquantum informationmatrix feasibility problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Cites Work

• On Projection Algorithms for Solving Convex Feasibility Problems
• Convex analysis and monotone operator theory in Hilbert spaces
• Regularization methods for semidefinite programming
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Title not available (Why is that?)
• Inequalities: theory of majorization and its applications
• Computing a nearest symmetric positive semidefinite matrix
• A relaxed alternating CQ-algorithm for convex feasibility problems
• Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
• Title not available (Why is that?)
• The method of projections for finding the common point of convex sets
• Equality relating Euclidean distance cone to positive semidefinite cone
• On rank-constrained Hermitian nonnegative-definite least squares solutions to the matrix equationAXA^H=B
• Title not available (Why is that?)
• Optimization and dynamical systems
• Alternating Projections on Manifolds
• How good are projection methods for convex feasibility problems?
• Steered sequential projections for the inconsistent convex feasibility problem
• Extrapolation algorithm for affine-convex feasibility problems
• Proximity Maps for Convex Sets
• One-qubit reduced states of a pure many-qubit state: polygon inequalities
• Subgradient projection algorithms for convex feasibility problems in the presence of computational errors
• A non-interior continuation algorithm for solving the convex feasibility problem
• Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
• A relaxed alternating projection method for solving a linear matrix equation problem under closed convex constraints
• On extremal quantum states of composite systems with fixed marginals
• A simultaneous projections method for linear inequalities

Cited In (2)

• Numerical Sensitivity of Linear Matrix Inequalities Using Shift and Delta Operators
• A projected gradient method for optimization over density matrices

This page was built for publication: Numerical methods for solving some matrix feasibility problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q509640)