A minimax method with application to the initial vector coding problem<sup>*</sup> (Q4384040)
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 1143882
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A minimax method with application to the initial vector coding problem<sup>*</sup> |
scientific article; zbMATH DE number 1143882 |
Statements
A minimax method with application to the initial vector coding problem<sup>*</sup> (English)
0 references
8 September 1998
0 references
minimax methods
0 references
initial vector
0 references
coding problem
0 references
numerical experiments
0 references
0 references
0.89228284
0 references
0.87016094
0 references
0 references
0.8637723
0 references
0.8630373
0 references
0 references
0.8596745
0 references
This paper deals with the minimax problem: \[ {\underset x\in \mathbb{R} {\text{Minimize}}} \max \bigl(f_1(x), \dots, f_m(x) \bigr) \] where \(f_1, \dots, f_n: \mathbb{R}^n\to \mathbb{R}^n\) are generally nonlinear differentiable functions. A new method is proposed based on a fast one-dimensional Newtonian procedure applied to the objective value of an auxiliary function. Numerical experiments are given and the authors suggest a new algorithm, combined with a powerful strategy for minimization on spheres, for solving vector coding problems.
0 references
