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 this page instead for the normal view: A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs |
scientific article; zbMATH DE number 6802484
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
