A minimax method with application to the initial vector coding problem*

DOI10.1080/00207169708804590MaRDI QIDQ4384040zbMATH OpenOpenAlexFDO

Authors L. T. Santos, J. M. Martínez, S. A. Santos

Publication date 8 September 1998

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169708804590

zbMATH Keywords

coding probleminitial vectorminimax methodsnumerical experiments

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Review text

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.

Recommendations

• A source matching approach to finding minimax codes
• A class of minimum linear codes and their applications
• Minimax nonredundant channel coding
• Optimal codes for minimax criterion on error detection
• On the optimal coding of one class of vector functions
• Minimal vectors in linear codes
• scientific article; zbMATH DE number 4093361
• scientific article; zbMATH DE number 4191549
• On the maximum number of minimal codewords
• Minimax theorems for finite blocklength lossy joint source-channel coding over an arbitrarily varying channel

Cites work

• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• A new trust region algorithm for bound constrained minimization
• A Regularization Method for Solving the Finite Convex Min-Max Problem
• A trust-region strategy for minimization on arbitrary domains
• Distance Properties of Group Codes for the Gaussian Channel
• scientific article; zbMATH DE number 3912096 (Why is no real title available?)
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 3793774 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
• On the Resolution of Linearly Constrained Convex Minimization Problems
• Permutation codes for the Gaussian channel

This page was built for publication: A minimax method with application to the initial vector coding problem^*

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4384040)