A sequential cutting plane algorithm for solving convex NLP problems (Q2496070)
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 5038007
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sequential cutting plane algorithm for solving convex NLP problems |
scientific article; zbMATH DE number 5038007 |
Statements
A sequential cutting plane algorithm for solving convex NLP problems (English)
0 references
30 June 2006
0 references
convex programming
0 references
nonlinear programming
0 references
cutting plane algorithms
0 references
sequential linear programming
0 references
0 references
0.8351033926010132
0 references
0.8350683450698853
0 references
0.8133977651596069
0 references
0.8075765371322632
0 references
