scientific article; zbMATH DE number 1054749
From MaRDI portal
Publication:4352296
Recommendations
- Quadratic Convergence in a Primal-Dual Method
- Convergence analysis of an inexact feasible interior point method for convex quadratic programming
- On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
- A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions
Cited in
(7)- A globally convergent primal-dual interior point algorithm for convex programming
- Error bounds in mathematical programming
- On the convergence of the iteration sequence in primal-dual interior- point methods
- On the convergence of primal-dual interior-point methods with wide neighborhoods
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
- Convergence analysis of approximate primal solutions in dual first-order methods
- Convergence analysis of an inexact feasible interior point method for convex quadratic programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352296)