A projected gradient method for optimization over density matrices
From MaRDI portal
Publication:2815508
DOI10.1080/10556788.2015.1082105zbMath1342.65143OpenAlexW2173044277WikidataQ62562125 ScholiaQ62562125MaRDI QIDQ2815508
Márcia Ap. Gomes-Ruggiero, Douglas S. Gonçalves, Carlile C. Lavor
Publication date: 29 June 2016
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2015.1082105
semidefinite programmingnumerical experimentquantum state tomographyquantum state estimationprojected gradientfixed-point iterations
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Applications of mathematical programming (90C90) Quantum state estimation, approximate cloning (81P50)
Related Items
Inexact variable metric method for convex-constrained optimization problems ⋮ Bayesian inference for quantum state tomography ⋮ An inexact projected LM type algorithm for solving convex constrained nonlinear equations ⋮ An online optimization algorithm for the real-time quantum state tomography ⋮ Inexact gradient projection method with relative error tolerance ⋮ Accelerated method for optimization over density matrices in quantum state estimation ⋮ On the inexact scaled gradient projection method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A primal-dual interior point method for nonlinear semidefinite programming
- An inexact primal-dual path following algorithm for convex quadratic SDP
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- Quantum state reconstruction from incomplete data
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- An interior method for nonconvex semidefinite programs
- A purely geometric approach to the problem of computing the projection of a point on a simplex
- Separability of mixed states: necessary and sufficient conditions.
- Semidefinite optimization
- Two-Point Step Size Gradient Methods
- LAPACK Users' Guide
- Finding the nearest point in A polytope
- Numerical Optimization
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- PENNON: A code for convex nonlinear and semidefinite programming
- Inexact spectral projected gradient methods on convex sets
- Separability Criterion for Density Matrices
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Symmetric informationally complete quantum measurements
- Semidefinite Programming
- Generating random density matrices
- On the Barzilai and Borwein choice of steplength for the gradient method
- Geometry of Quantum States
- Practical Augmented Lagrangian Methods for Constrained Optimization
