The approximation algorithm for solving a sort of non-smooth programming (Q884618)
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 5162006
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The approximation algorithm for solving a sort of non-smooth programming |
scientific article; zbMATH DE number 5162006 |
Statements
The approximation algorithm for solving a sort of non-smooth programming (English)
0 references
6 June 2007
0 references
The authors present an approximation algorithm for solving a sort of non-smooth programming, in which the objective function is the Hölder function and the feasible region is contained in a rectangle (viz. hyper-rectangle). To establish the algorithm, the properties of the Hölder function and an approximation of the function by using Bernstein \(\alpha\)-polynomials are studied. The convergence of the algorithm can be guaranteed by the exhaustive of the bisection of the rectangle. The feasibility of the algorithm is validated by solving an example.
0 references
non-smooth programming
0 references
numerical examples
0 references
Hölder function
0 references
approximation polynomial
0 references
geometrical programming
0 references
branch-and-bound algorithm
0 references
0 references
0 references
0 references
0.7339231371879578
0 references
0.7299548387527466
0 references
