On Long Step Path Following and SUMT for Linear and Quadratic Programming

DOI10.1137/0806003zbMath0852.90105OpenAlexW1965660560MaRDI QIDQ4877504

Kurt M. Anstreicher

Publication date: 13 May 1996

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

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

zbMATH Keywords

linear inequality constraintssequential unconstrained minimizationconvex quadratic objectivelong step barrier algorithmlong step path following

Mathematics Subject Classification ID

Quadratic programming (90C20) Linear programming (90C05)

Related Items (3)

Interior-point methods: An old and new approach to nonlinear programming ⋮ A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming ⋮ Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem

This page was built for publication: On Long Step Path Following and SUMT for Linear and Quadratic Programming