A cutting plane method for solving minimax problems in the complex plane (Q1200545): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CAPROX / rank | |||
Normal rank | |||
Revision as of 13:06, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A cutting plane method for solving minimax problems in the complex plane |
scientific article |
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
