A subgradient algorithm for certain minimax and minisum problems

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.

[1]  Harold W. Kulin,et al.  AN EFFICIENT ALGORITHM FOR THE NUMERICAL SOLUTION OF THE GENERALIZED WEBER PROBLEM IN SPATIAL ECONOMICS , 1962 .

[2]  E. Gilbert An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set , 1966 .

[3]  J. Greenstadt Variations on variable-metric methods. (With discussion) , 1970 .

[4]  J. Greenstadt Variations on Variable-Metric Methods , 1970 .

[5]  B. N. Pshenichnyi Necessary Conditions for an Extremum , 1971 .

[6]  D. Bertsekas,et al.  A DESCENT NUMERICAL METHOD FOR OPTIMIZATION PROBLEMS WITH NONDIFFERENTIABLE COST FUNCTIONALS , 1973 .

[7]  E. Polak Introduction to linear and nonlinear programming , 1973 .

[8]  John A. White,et al.  On Solving Multifacility Location Problems using a Hyperboloid Approximation Procedure , 1973 .

[9]  Claude Lemaréchal Note on an extension of “Davidon” methods to nondifferentiable functions , 1974, Math. Program..

[10]  Albert Feuer An implementable mathematical programming algorithm for admissible-fundamental functions. , 1974 .

[11]  R. L. Francis,et al.  A Network Flow Solution to a Multifacility Minimax Location Problem Involving Rectilinear Distances , 1974 .

[12]  P. Wolfe Note on a method of conjugate subgradients for minimizing nondifferentiable functions , 1974 .

[13]  V. F. Demʹi︠a︡nov,et al.  Introduction to minimax , 1976 .

[14]  C. Lemaréchal An extension of davidon methods to non differentiable problems , 1975 .

[15]  F. Clarke Generalized gradients and applications , 1975 .

[16]  P. Wolfe,et al.  The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices , 1975 .

[17]  Philip Wolfe,et al.  Finding the nearest point in A polytope , 1976, Math. Program..

[18]  D. Hearn,et al.  Minimax Multifacility Location with Euclidean Distances , 1976 .

[19]  Robert Mifflin,et al.  An Algorithm for Constrained Optimization with Semismooth Functions , 1977, Math. Oper. Res..

[20]  A. A. Goldstein,et al.  Optimization of lipschitz continuous functions , 1977, Math. Program..

[21]  D. Hearn,et al.  A Subgradient Procedure for the Solution of Minimax Location Problems. , 1978 .