Smoothing SQP algorithm for semismooth equations with box constraints (Q2376126)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6181357
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Smoothing SQP algorithm for semismooth equations with box constraints |
scientific article; zbMATH DE number 6181357 |
Statements
Smoothing SQP algorithm for semismooth equations with box constraints (English)
0 references
26 June 2013
0 references
semismooth equations with box constraints
0 references
SQP algorithm
0 references
global convergence
0 references
finite termination
0 references
superlinear convergence rate
0 references
0 references
0 references
0 references
0 references
0 references
0.833384096622467
0 references
0.8066866397857666
0 references
0.7949244379997253
0 references
0.7884384989738464
0 references
0.7845742106437683
0 references
