Publication:3804467
From MaRDI portal
zbMath0656.90085MaRDI QIDQ3804467
Publication date: 1988
convergence rate; center curve; centering direction; guiding cone; penalized norms; step length computation
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
49M15: Newton-type methods
Related Items
A unified approach to interior point algorithms for linear complementarity problems: A summary, Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions, Degeneracy in interior point methods for linear programming: A survey, A primal-dual infeasible-interior-point algorithm for linear programming, A globally convergent primal-dual interior point algorithm for convex programming, Global convergence in infeasible-interior-point algorithms, Interior-point algorithms for semi-infinite programming, Constant potential primal-dual algorithms: A framework, Polynomiality of infeasible-interior-point algorithms for linear programming, A QMR-based interior-point algorithm for solving linear programs, Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs, Theoretical convergence of large-step primal-dual interior point algorithms for linear programming, On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems, Convergence analysis of an inexact potential reduction method for convex quadratic programming, Stopping criteria for inner iterations in inexact potential reduction methods: a computational study
