The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming (Q3544257): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1137/060657741 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2038589630 / rank | |||
Normal rank |
Latest revision as of 21:05, 19 March 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