scientific article

zbMath0656.90085MaRDI QIDQ3804467

Kunio Tanabe

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

convergence ratecenter curvecentering directionguiding conepenalized normsstep length computation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Newton-type methods (49M15)

Related Items (23)

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 ⋮ Theoretical convergence of large-step primal-dual interior point algorithms for linear programming ⋮ Constant potential primal-dual algorithms: A framework ⋮ Polynomiality of infeasible-interior-point algorithms for linear programming ⋮ A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem ⋮ Stopping criteria for inner iterations in inexact potential reduction methods: a computational study ⋮ A QMR-based interior-point algorithm for solving linear programs ⋮ Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs ⋮ Primal-Dual Path-Following Methods and the Trust-Region Updating Strategy for Linear Programming with Noisy Data ⋮ A unified approach to interior point algorithms for linear complementarity problems: A summary ⋮ 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 ⋮ A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization ⋮ Simplified infeasible interior-point algorithm for linear optimization based on a simple function ⋮ An adaptive infeasible interior-point algorithm for linear complementarity problems ⋮ A potential reduction method for tensor complementarity problems ⋮ Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning ⋮ A Newton-like method for nonlinear system of equations ⋮ 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

This page was built for publication: