Finiteness in restricted simplicial decomposition (Q1069859)
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 3932797
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finiteness in restricted simplicial decomposition |
scientific article; zbMATH DE number 3932797 |
Statements
Finiteness in restricted simplicial decomposition (English)
0 references
1985
0 references
A version of a simplicial decomposition of an n variables large scale optimization nonlinear programming problem with linear constraints, where the number of retained extreme points is restricted to r, \(1\leq r\leq n+1\), is presented. It is proved that if r is sufficiently large an optimal simplex will be reached in a finite number of major cycles.
0 references
simplicial decomposition
0 references
large scale optimization
0 references
linear constraints
0 references
0.8143367767333984
0 references
0.7908895015716553
0 references
0.7849295139312744
0 references
0.7512884736061096
0 references
