A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs (Q1675550)
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 6802484
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs |
scientific article; zbMATH DE number 6802484 |
Statements
A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs (English)
0 references
2 November 2017
0 references
SIP
0 references
NLP
0 references
nonconvex
0 references
feasible point method
0 references
global optimization
0 references
0 references
0 references
0 references
0 references
0.8402933478355408
0 references
0.8364574313163757
0 references
0.7919988632202148
0 references
0.7888550162315369
0 references
0.7821974754333496
0 references
