Log-domain interior-point methods for convex quadratic programming
From MaRDI portal
Publication:6164958
DOI10.1007/s11590-022-01952-zarXiv2212.02294OpenAlexW4313890592MaRDI QIDQ6164958
Publication date: 28 July 2023
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.02294
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new primal-dual path-following method for convex quadratic programming
- A new polynomial-time algorithm for linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs
- On implementing a primal-dual interior-point method for conic quadratic optimization
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
- Duality in quadratic programming
- On the central path for nonlinear semidefinite programming
- Multiplicative Updates for Nonnegative Quadratic Programming
- A Geodesic Interior-Point Method for Linear Optimization over Symmetric Cones
This page was built for publication: Log-domain interior-point methods for convex quadratic programming