Why a Pure Primal Newton Barrier Step May be Infeasible

DOI10.1137/0805001zbMath0821.65039OpenAlexW2092677228MaRDI QIDQ4764306

Margaret H. Wright

Publication date: 4 May 1995

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0805001

zbMATH Keywords

constrained optimizationnumerical examplesnonlinear programmingprimal Newton barrier method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

The interior-point revolution in optimization: History, recent developments, and lasting consequences ⋮ Sphere of convergence of Newton's method on two equivalent systems from nonlinear programming. ⋮ A general class of penalty/barrier path-following Newton methods for nonlinear programming ⋮ Local behavior of the Newton method on two equivalent systems from linear programming ⋮ A globally convergent primal-dual interior-point relaxation method for nonlinear programs ⋮ New theoretical results on recursive quadratic programming algorithms ⋮ A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs

This page was built for publication: Why a Pure Primal Newton Barrier Step May be Infeasible