Basis- and partition identification for quadratic programming and linear complementarity problems
type: Item
instance of: scholarly article
title: Basis- and partition identification for quadratic programming and linear complementarity problems
zbMATH Open document ID: 0946.90091
author: Arjan B. Berkelaar
author: Kees Roos
author: Benjamin Jansen
author: Tamás Terlaky
published in: Mathematical Programming. Series A. Series B
publication date: 2000-01-30T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 1394868
zbMATH Keywords: basis recovery
zbMATH Keywords: partition
zbMATH Keywords: principal pivot transforms
zbMATH Keywords: Balinski-Tucker tableaux
zbMATH Keywords: quadratic programming
zbMATH Keywords: linear complementarity problems
zbMATH Keywords: interior point methods
zbMATH Keywords: Criss-Cross method
zbMATH Keywords: crossover
zbMATH Keywords: sufficient matrices
MaRDI profile type: Publication
full work available at URL: s101070050089
OpenAlex ID: W1974587700
DOI: 10.1007/S101070050089
Recommended article: Identifying the optimal partition in convex quadratic programming
Recommended article: The complementary basis method for problems of convex quadratic programming
Recommended article: Q4395415
Recommended article: A method of complementary basis for quadratic programming
Recommended article: On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming
Recommended article: An optimal-basis identification technique for interior-point linear programming algorithms
Recommended article: Q4336495
Recommended article: Q3364652
Recommended article: On the identification of the optimal partition for semidefinite optimization
Recommended article: Quadratic programming problems and related linear complementarity problems
description: scientific article; zbMATH DE number 1394868