A weighted gram-schmidt method for convex quadratic programming

Philip E. Gill, Nicholas I M Gould, Walter Murray, Michael A. Saunders, Margaret Wright

Research output: Contribution to journalArticle

Abstract

Range-space methods for convex quadratic programming improve in efficiency as the number of constraints active at the solution decreases. In this paper we describe a range-space method based upon updating a weighted Gram-Schmidt factorization of the constraints in the active set. The updating methods described are applicable to both primal and dual quadratic programming algorithms that use an active-set strategy. Many quadratic programming problems include simple bounds on all the variables as well as general linear constraints. A feature of the proposed method is that it is able to exploit the structure of simple bound constraints. This allows the method to retain efficiency when the number of general constraints active at the solution is small. Furthermore, the efficiency of the method improves as the number of active bound constraints increases.

Original languageEnglish (US)
Pages (from-to)176-195
Number of pages20
JournalMathematical Programming
Volume30
Issue number2
DOIs
StatePublished - Oct 1984

Fingerprint

Convex Quadratic Programming
Quadratic programming
Bound Constraints
Quadratic Programming
Factorization
Updating
Active Set Strategy
Active Set
Linear Constraints
Range of data
Decrease

Keywords

  • Active-Set Methods
  • Bound Constraints
  • Convex Quadratic Programming
  • Range-Space Methods
  • Updated Orthogonal Factorizations

ASJC Scopus subject areas

  • Mathematics(all)
  • Software
  • Engineering(all)

Cite this

A weighted gram-schmidt method for convex quadratic programming. / Gill, Philip E.; Gould, Nicholas I M; Murray, Walter; Saunders, Michael A.; Wright, Margaret.

In: Mathematical Programming, Vol. 30, No. 2, 10.1984, p. 176-195.

Research output: Contribution to journalArticle

Gill, Philip E. ; Gould, Nicholas I M ; Murray, Walter ; Saunders, Michael A. ; Wright, Margaret. / A weighted gram-schmidt method for convex quadratic programming. In: Mathematical Programming. 1984 ; Vol. 30, No. 2. pp. 176-195.
@article{af6653249e3f4fc48b7f3fb600c60ab3,
title = "A weighted gram-schmidt method for convex quadratic programming",
abstract = "Range-space methods for convex quadratic programming improve in efficiency as the number of constraints active at the solution decreases. In this paper we describe a range-space method based upon updating a weighted Gram-Schmidt factorization of the constraints in the active set. The updating methods described are applicable to both primal and dual quadratic programming algorithms that use an active-set strategy. Many quadratic programming problems include simple bounds on all the variables as well as general linear constraints. A feature of the proposed method is that it is able to exploit the structure of simple bound constraints. This allows the method to retain efficiency when the number of general constraints active at the solution is small. Furthermore, the efficiency of the method improves as the number of active bound constraints increases.",
keywords = "Active-Set Methods, Bound Constraints, Convex Quadratic Programming, Range-Space Methods, Updated Orthogonal Factorizations",
author = "Gill, {Philip E.} and Gould, {Nicholas I M} and Walter Murray and Saunders, {Michael A.} and Margaret Wright",
year = "1984",
month = "10",
doi = "10.1007/BF02591884",
language = "English (US)",
volume = "30",
pages = "176--195",
journal = "Mathematical Programming",
issn = "0025-5610",
publisher = "Springer-Verlag GmbH and Co. KG",
number = "2",

}

TY - JOUR

T1 - A weighted gram-schmidt method for convex quadratic programming

AU - Gill, Philip E.

AU - Gould, Nicholas I M

AU - Murray, Walter

AU - Saunders, Michael A.

AU - Wright, Margaret

PY - 1984/10

Y1 - 1984/10

N2 - Range-space methods for convex quadratic programming improve in efficiency as the number of constraints active at the solution decreases. In this paper we describe a range-space method based upon updating a weighted Gram-Schmidt factorization of the constraints in the active set. The updating methods described are applicable to both primal and dual quadratic programming algorithms that use an active-set strategy. Many quadratic programming problems include simple bounds on all the variables as well as general linear constraints. A feature of the proposed method is that it is able to exploit the structure of simple bound constraints. This allows the method to retain efficiency when the number of general constraints active at the solution is small. Furthermore, the efficiency of the method improves as the number of active bound constraints increases.

AB - Range-space methods for convex quadratic programming improve in efficiency as the number of constraints active at the solution decreases. In this paper we describe a range-space method based upon updating a weighted Gram-Schmidt factorization of the constraints in the active set. The updating methods described are applicable to both primal and dual quadratic programming algorithms that use an active-set strategy. Many quadratic programming problems include simple bounds on all the variables as well as general linear constraints. A feature of the proposed method is that it is able to exploit the structure of simple bound constraints. This allows the method to retain efficiency when the number of general constraints active at the solution is small. Furthermore, the efficiency of the method improves as the number of active bound constraints increases.

KW - Active-Set Methods

KW - Bound Constraints

KW - Convex Quadratic Programming

KW - Range-Space Methods

KW - Updated Orthogonal Factorizations

UR - http://www.scopus.com/inward/record.url?scp=0021504719&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0021504719&partnerID=8YFLogxK

U2 - 10.1007/BF02591884

DO - 10.1007/BF02591884

M3 - Article

VL - 30

SP - 176

EP - 195

JO - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 2

ER -