Journal article
A Subgradient Algorithm for Certain Minimax and Minisum Problems--The Constrained Case
SIAM journal on control and optimization, Vol.20(4), pp.455-469
07/01/1982
DOI: 10.1137/0320034
Abstract
We present an implementable feasible direction subgradient algorithm for minimizing the maximum of a finite collection of functions subject to constraints. It is assumed that each function involved in defining the objective 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 involving functions of $l_p$-norms, such as location and approximation problems, can be put in this form. Conditions are given which guarantee that the algorithm generates a feasible sequence converging to an optimal solution. The results of computational tests on some location problems are included. In these tests we explore the sensitivity of the algorithm to its parameters.
Details
- Title: Subtitle
- A Subgradient Algorithm for Certain Minimax and Minisum Problems--The Constrained Case
- Creators
- Jacques ChatelonDonald HearnTimothy J Lowe
- Resource Type
- Journal article
- Publication Details
- SIAM journal on control and optimization, Vol.20(4), pp.455-469
- DOI
- 10.1137/0320034
- ISSN
- 0363-0129
- eISSN
- 1095-7138
- Publisher
- Society for Industrial and Applied Mathematics
- Language
- English
- Date published
- 07/01/1982
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963209302771
Metrics
1 Record Views