A sequential quadratic programming algorithm utilizing qr matrix factorization

Chiang Kao, Shih Pen Chen

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


Some recent studies indicate that the sequential quadratic programming (SQP) approach has a sound theoretical basis and promising empirical results for solving general constrained optimization problems. This paper presents a variant of the SQP method which utilizes QR matrix factorization to solve the quadratic programming subproblem which result from taking a quadratic approximation of the original problem. Theoretically, the QR factorization method is more robust and computationally efficient in solving quadratic programs. To demonstrate the validity of this variant, a computer program named SQR is coded in Fortran to solve twenty-eight test problems. By comparing with three other algorithms: one multiplier method, one GRG-type method, and another SQP-type method, the numerical results show that, in general, SQR as devised in this paper is the best method as far as robustness and speed of convergence are concerned in solving general constrained optimization problems.

Original languageEnglish
Pages (from-to)283-296
Number of pages14
JournalEngineering Optimization
Issue number4
Publication statusPublished - 1994 May 1

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Control and Optimization
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics


Dive into the research topics of 'A sequential quadratic programming algorithm utilizing qr matrix factorization'. Together they form a unique fingerprint.

Cite this