scientific article; zbMATH DE number 175722
From MaRDI portal
Publication:4034773
[For the entire collection see Zbl 0734.00011.] A subgradient optimization procedure is proposed and its convergence proved for constrained minimization of a function which is a maximum of a finite number of convex functions. The procedure differs from the general methods in the information used for computing the next iterate, i.e. by using the value and subgradient of a function which underestimate the objective function.
Recommendations
- scientific article; zbMATH DE number 617944
- The solution of discrete minimax problems
- scientific article; zbMATH DE number 4047451
- Sequential minimaxization under dynamic programming structure
- Global minimax approaches for solving discrete problems
- Min-max optimization of several classical discrete optimization problems
- Problemi di minimax di tipo discreto: Un approccio unificato mediante il teorema dell'alternativa di Motzkin
- Su un problema di minimax discreto
- scientific article; zbMATH DE number 1560354
- scientific article; zbMATH DE number 895365
Cited in
(4)- Ersatz function method for minimizing a finite-valued function on a compact set
- Gradient methods of maximization of convex functions on discrete structures
- scientific article; zbMATH DE number 2011602 (Why is no real title available?)
- scientific article; zbMATH DE number 2074249 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4034773)