|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 56 van 219 gevonden artikelen
| Titel: |
A SEQUENTIAL QUADRATIC PROGRAMMING ALGORITHM UTILIZING QR MATRIX FACTORIZATION |
| Auteur: |
Kao, Chiang Chen, Shih Pen |
| Verschenen in: |
Engineering optimization |
| Paginering: | Jaargang 22 (1994) nr. 4 pagina's 283-296 |
| Jaar: |
1994-05-01 |
| Inhoud: |
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. |
| Uitgever: |
Taylor & Francis |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 56 van 219 gevonden artikelen
| << vorige | volgende >> |