Quantum computing inspired iterative refinement for semidefinite optimization
From MaRDI portal
Cites work
- A computational status update for exact rational mixed integer programming
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- A faster cutting plane method and its implications for combinatorial and convex optimization
- A faster interior point method for semidefinite programming
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A Note on the Local Convergence of a Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Based on the Alizadeh--Haeberly--Overton Search Direction
- A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh--Haeberly--Overton Search Direction
- A quantum interior-point predictor–corrector algorithm for linear programming
- A semidefinite program for distillable entanglement
- A semidefinite programming approach to optimal unambiguous discrimination of quantum states
- A Spectral Bundle Method for Semidefinite Programming
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- An improved cutting plane method for convex optimization, convex-concave games, and its applications
- An Interior-Point Method for Semidefinite Programming
- Convergence analysis of an inexact infeasible interior point method for semidefinite programming
- Degeneracy in interior point methods for linear programming: A survey
- Efficient use of quantum linear system algorithms in inexact infeasible IPMs for linear optimization
- First- and second-order methods for semidefinite programming
- scientific article; zbMATH DE number 1024452 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Improvements in quantum SDP-solving with applications
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Iterative refinement for linear programming
- Learning the kernel matrix with semidefinite programming
- Linear Matrix Inequalities in System and Control Theory
- Linear programming using limited-precision oracles
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Lx = b
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- On semidefinite representations of second-order conic optimization problems
- On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
- On the Nesterov--Todd Direction in Semidefinite Programming
- On the Shannon capacity of a graph
- Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
- Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- Quantum tomography using state-preparation unitaries
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Semidefinite programs for completely bounded norms
- Shadow tomography of quantum states
- Solving SDP faster: a robust IPM framework and efficient implementation
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
- Superlinear convergence of an interior point algorithm on linear semi-definite feasibility problems
- The multiplicative weights update method: a meta-algorithm and applications
- The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
- Towards an accurate solution of wireless network design problems
This page was built for publication: Quantum computing inspired iterative refinement for semidefinite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7316964)
