The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming (Q3544257)
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 5378741
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming |
scientific article; zbMATH DE number 5378741 |
Statements
The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming (English)
0 references
5 December 2008
0 references
semi-infinite programming
0 references
\(\alpha\)BB
0 references
global optimization
0 references
convex optimization
0 references
mathematical program with complementarity constraints
0 references
bilevel optimization
0 references
0.9161601066589355
0 references
0.9003582000732422
0 references
0.8581176996231079
0 references
0.8496317267417908
0 references
