A subgradient algorithm for certain minimax and minisum problems |
| |
Authors: | J A Chatelon D W Hearn T J Lowe |
| |
Institution: | (1) Paris, France;(2) University of Florida, Gainesville, FL., USA |
| |
Abstract: | We present a subgradient algorithm for minimizing the maximum of a finite collection of functions. It is assumed that each function is the sum of a finite collection of basic convex functions and that the number of different subgradient sets associated with nondifferentiable points of each basic function is finite on any bounded set. Problems belonging to this class include the linear approximation problem and both the minimax and minisum problems of location theory. Convergence of the algorithm to an epsilon-optimal solution is proven and its effectiveness is demonstrated by solving a number of location problems and linear approximation problems.This research was partially supported by the Army Research Office, Triangle Park, NC, under contract number DAH-CO4-75-G-0150, and by NSF grants ENG 16-24294 and ENG 75-10225. |
| |
Keywords: | Minimax Problems Minisum Problems Nondifferentiable Optimization Subgradients Location Problems Linear Approximation Problems |
本文献已被 SpringerLink 等数据库收录! |