Article ID: | iaor19992647 |
Country: | Netherlands |
Volume: | 80 |
Issue: | 3 |
Start Page Number: | 315 |
End Page Number: | 380 |
Publication Date: | Feb 1998 |
Journal: | Mathematical Programming |
Authors: | Conn Andrew R., Mongeau Marcel |
Keywords: | programming: linear |
A theoretical framework and a practical algorithm are presented to solve discontinuous piecewise linear optimization problems dealing with functions for which the ridges are known. A penalty approach allows one to consider such problems subject to a wide range of constraints involving piecewise linear functions. Although the theory is expounded in detail in the special case of discontinuous piecewise linear functions, it is straightforwardly extendable, using standard nonlinear programming tehniques, to nonlinear (discontinuous piecewise differentiable) functions. The descent algorithm which is elaborated uses active-set and projected gradient approaches. It is a generalization of the ideas used by Conn to deal with nonsmoothness in the