A global method for some class of optimization and control problems (Q1578342)
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 global method for some class of optimization and control problems |
scientific article; zbMATH DE number 1496711
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A global method for some class of optimization and control problems |
scientific article; zbMATH DE number 1496711 |
Statements
A global method for some class of optimization and control problems (English)
0 references
2000
0 references
Summary: The problem of maximizing a nonsmooth convex function over an arbitrary set is considered. Based on the optimality condition obtained by Strekalovsky in 1987 an algorithm for solving the problem is proposed. We show that the algorithm can be applied to the nonconvex optimal control problem as well. We illustrate the method by describing some computational experiments performed on a few nonconvex optimal control problems.
0 references
global optimization
0 references
optimal control
0 references
optimality condition
0 references
convex function
0 references
simple set
0 references
0.8391292691230774
0 references
0.8374997973442078
0 references
0.8318788409233093
0 references
0.8230597376823425
0 references
