Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process

From MaRDI portal
Publication:2672023

DOI10.1134/S0965542522040133zbMATH Open1493.90128MaRDI QIDQ2672023FDOQ2672023


Authors: Yanyan Li Edit this on Wikidata


Publication date: 8 June 2022

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)





Recommendations




Cites Work


Cited In (4)





This page was built for publication: Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process

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