A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints (Q2369090): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.amc.2005.01.141 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AMC.2005.01.141 / rank | |||
Normal rank | |||
Latest revision as of 05:57, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints |
scientific article |
Statements
A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints (English)
0 references
28 April 2006
0 references
The authors propose an successive quadratic programming (SQP) algorithm for mathematical programs with linear complementarity constraints. Unlike previous approaches, they utilize a nonsmooth equation instead of the complementarity constraint and its smooth approximation for the construction of the SQP algorithm. The global and superlinear convergence of the method is established.
0 references
SQP algorithm
0 references
mathematical programs with complementarity constraints
0 references
superlinear convergence
0 references
successive quadratic programming
0 references
global convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
