Journal of Automation and Information Sciences

ISSN for PRINT: 1064-2315

For Online Access

Best Paper Award Selection - Editorial Board Site

2006, Volume38

Issue 5

83 pages

DOI: 10.1615/J Automat Inf Scien.v38.i5

Issue price - $238.00

Yuriy D. Shcherbashin
National Technical University of Ukraine "Kiev Polytechnical Institute", Ukraine

Consideration is given to approximation programming method with gradually increasing/decreasing basis dimension. If the solution is found in the vertex of limiting polyhedron, i.e., on the boundary of intersection of n-limiting hyperplane (n — dimension of space of searched variables), then the basis dimension reaches n; if the solution is on the faces or edges of limiting polyhedron, then the basis dimension decreases. With the solution found inside the admissible domain, then the basis dimension is zero and X-trace on the last steps corresponds to the fastest descent (ascent) algorithm. The other feature of the method is the application of quadratic approximation of discrepancy Δ φ_i (X) variation along admissible appropriate direction — ray σ — linear combination of edges of current basis cone. The quadratic approximation method enables us to increase the step length in comparison with the simplest methods of approximation programming.

DOI: 10.1615/J Automat Inf Scien.v38.i5.30 Download article, 23-33 pages

Article price - $35.00

<< Previous article   Next article >>