The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming (Q3544257): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: INTLAB / rank | |||
Normal rank | |||
Revision as of 20:48, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming |
scientific article |
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
