A dual-active-set algorithm for positive semi-definite quadratic programming
type: Item
instance of: scholarly article
title: A dual-active-set algorithm for positive semi-definite quadratic programming
zbMATH Open document ID: 0893.90139
DOI: 10.1016/S0025-5610(96)00069-X
published in: Mathematical Programming. Series A. Series B
publication date: 1997-11-25T00:00:00Z
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 1091288
zbMATH Keywords: active-set method
zbMATH Keywords: positive semi-definite
zbMATH Keywords: finite termination
zbMATH Keywords: generalized algorithm
author: Natashia Boland
MaRDI profile type: Publication
full work available at URL: s0025-5610(96)00069-x
OpenAlex ID: W4239349808
Recommended article: A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
Recommended article: An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
Recommended article: Primal and dual active-set methods for convex quadratic programming
Recommended article: On active-set methods for the quadratic programming problem
Recommended article: A dual method for solving positive definite quadratic programming
Recommended article: An active-set algorithm for norm constrained quadratic problems
Recommended article: Positive semidefinite penalty method for quadratically constrained quadratic programming
Recommended article: Q4382708
Recommended article: The dual active set algorithm and its application to linear programming
Recommended article: An \(O(n^2)\) active set algorithm for the solution of a parametric quadratic program
description: scientific article; zbMATH DE number 1091288