The Complexity of Computing KKT Solutions of Quadratic Programs.

Fearnley, John, Goldberg, Paul W, Hollender, Alexandros and Savani, Rahul ORCID: 0000-0003-1262-7831 (2025) The Complexity of Computing KKT Solutions of Quadratic Programs. J. ACM, 72. 31:1-31:1. ISSN 0004-5411, 1557-735X

Access the full-text of this item by clicking on the Open Access link.

Text polynomial_KKT_accepted_version.pdf - Author Accepted Manuscript Available under License Creative Commons Attribution. Download (868kB) | Preview

Item Type:	Article
Divisions:	Faculty of Science & Engineering > School of Electrical Engineering, Electronics and Computer Science Faculty of Science & Engineering
Depositing User:	Symplectic Admin
Date Deposited:	02 Jun 2025 10:20
Last Modified:	03 Dec 2025 15:24
Open Access URL:	https://doi.org/10.1145/3745017
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3192928
Disclaimer:	The University of Liverpool is not responsible for content contained on other websites from links within repository metadata. Please contact us if you notice anything that appears incorrect or inappropriate.