Steplengths in interior-point algorithms of quadratic programming
type: Item
instance of: scholarly article
title: Steplengths in interior-point algorithms of quadratic programming
zbMATH Open document ID: 0954.90031
DOI: 10.1016/S0167-6377(99)00028-0
published in: Operations Research Letters
publication date: 2001-02-09T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 1347052
zbMATH Keywords: infeasible-interior-point primal-dual method
zbMATH Keywords: convex quadratic problems
zbMATH Keywords: efficient set
zbMATH Keywords: multiobjective optimization
author: Csaba Mészáros
describes a project that uses: NETLIB LP Test Set
describes a project that uses: LOQO
MaRDI profile type: Publication
cites work: Q4347846
cites work: Q4311902
cites work: Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
cites work: A primal-dual infeasible-interior-point algorithm for linear programming
cites work: Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming
cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming
cites work: On superlinear convergence of infeasible interior-point algorithms for linearly constrained convex programs
cites work: Q5691079
full work available at URL: s0167-6377(99)00028-0
OpenAlex ID: W2007912094
Wikidata QID: Q127723506
description: scientific article; zbMATH DE number 1347052