An Algorithm for Constrained Optimization with Semismooth Functions

Mifflin R (1977). An Algorithm for Constrained Optimization with Semismooth Functions. IIASA Research Report. IIASA, Laxenburg, Austria: RR-77-003

[img]
Preview
Text
RR-77-003.pdf

Download (815kB) | Preview

Abstract

We present an implementable algorithm for solving constrained optimization problems defined by functions that are not everywhere differentiable. The method is based on combining, modifying and extending the nonsmooth optimization work of Wolfe, Lemarechal, Feuer, Poljak, and Merrill. It can be thought of as a generalized reset conjugate gradient algorithm.

We also introduce the class of weakly upper semismooth functions. These functions are locally Lipschitz and have a semicontinuous relationship between their generalized gradient sets and their directional derivatives. The algorithm is shown to converge to stationary points of the optimization problem if the objective and constraint functions are weakly upper semismooth. Such points are optimal points if the problem functions are also semiconvex and a constraint qualification is satisfied. Under stronger convexity assumptions, bounds on the deviation from optimality of the algorithm iterates are given.

Item Type: Monograph (IIASA Research Report)
Research Programs: System and Decision Sciences - Core (SDS)
Depositing User: IIASA Import
Date Deposited: 15 Jan 2016 01:44
Last Modified: 06 Nov 2016 07:19
URI: http://pure.iiasa.ac.at/712

Actions (login required)

View Item View Item

International Institute for Applied Systems Analysis (IIASA)
Schlossplatz 1, A-2361 Laxenburg, Austria
Phone: (+43 2236) 807 0 Fax:(+43 2236) 71 313