The Newton modified barrier method for QP problems
type: Item
instance of: scholarly article
title: The Newton modified barrier method for QP problems
zbMATH Open document ID: 0848.90099
DOI: 10.1007/BF02206827
published in: Annals of Operations Research
publication date: 1996-11-03T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 894994
zbMATH Keywords: modified barrier functions
zbMATH Keywords: hot start
zbMATH Keywords: relaxation operator
zbMATH Keywords: Newton MBF method
zbMATH Keywords: second-order optimality conditions
zbMATH Keywords: Lagrange multipliers
zbMATH Keywords: condition number
author: Aaron Melman
author: Roman A. Polyak
MaRDI profile type: Publication
cites work: Q3331506
cites work: Q4311902
cites work: Q3690580
cites work: On the classical logarithmic barrier function method for a class of smooth convex programming problems
cites work: Q5588268
cites work: Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
cites work: Path-Following Methods for Linear Programming
cites work: An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
cites work: Q3995706
cites work: The convergence of a modified barrier method for convex programming
cites work: Q5332416
cites work: Q4311917
cites work: Q3797760
cites work: Q3688994
cites work: Modified barrier functions (theory and methods)
cites work: Nonlinear rescaling and proximal-like methods in convex optimization
cites work: Unified complexity analysis for Newton LP methods
cites work: A duality theorem for non-linear programming
full work available at URL: https://doi.org/10.1007/bf02206827
OpenAlex ID: W2038435941
description: scientific article; zbMATH DE number 894994