A cutting plane method for solving minimax problems in the complex plane (Q1200545)
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 cutting plane method for solving minimax problems in the complex plane |
scientific article; zbMATH DE number 95472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cutting plane method for solving minimax problems in the complex plane |
scientific article; zbMATH DE number 95472 |
Statements
A cutting plane method for solving minimax problems in the complex plane (English)
0 references
16 January 1993
0 references
The author's recent discretization and cutting plane method for general convex semi-infinite programming problems is implemented for the solution of a minimax problem in the complex plane; the problem need not be linearized. The method is illustrated on several examples.
0 references
numerical examples
0 references
cutting plane method
0 references
convex semi-infinite programming
0 references
minimax problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.90551627
0 references
0.89209276
0 references
0.8911102
0 references
0.88754034
0 references
0.8870642
0 references
