A feasible direction subgradient algorithm for a class of nondifferentiable optimization problems

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 tha...

Full description

Saved in:
Bibliographic Details
Published in1979 18th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes Vol. 2; pp. 439 - 444
Main Authors Chatelon, Jacques, Hearn, Donald, Lowe, Timothy J.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.1979
Subjects
Linear approximation
Optimization methods
Online AccessGet full text
DOI10.1109/CDC.1979.270212

Cover

More Information
Summary: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. It is demonstrated that under certain conditions, including continuous differentiability of the constraints and a regularity condition of the µ feasible region, that the algorithm generates a feasible sequence which converges to an ε-optimal solution. Computational results for some example problems are included.
DOI:10.1109/CDC.1979.270212