A globally convergent line search filter SQP method for inequality constrained optimization (Q1789979)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A globally convergent line search filter SQP method for inequality constrained optimization |
scientific article; zbMATH DE number 6950729
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A globally convergent line search filter SQP method for inequality constrained optimization |
scientific article; zbMATH DE number 6950729 |
Statements
A globally convergent line search filter SQP method for inequality constrained optimization (English)
0 references
10 October 2018
0 references
Summary: A line search filter SQP method for inequality constrained optimization is presented. This method makes use of a backtracking line search procedure to generate step size and the efficiency of the filter technique to determine step acceptance. At each iteration, the subproblem is always consistent, and it only needs to solve one QP subproblem. Under some mild conditions, the global convergence property can be guaranteed. In the end, numerical experiments show that the method in this paper is effective.
0 references
0.9449325203895568
0 references
0.9038251042366028
0 references
0.8886906504631042
0 references
0.8812310695648193
0 references
0.8670925498008728
0 references
