On the Steepest Descent Method for a Class of Quasi-Differentiable Optimization Problems

Pallaschke D & Recht P (1984). On the Steepest Descent Method for a Class of Quasi-Differentiable Optimization Problems. IIASA Collaborative Paper. IIASA, Laxenburg, Austria: CP-84-057

[img]
Preview
Text
CP-84-057.pdf

Download (354kB) | Preview

Abstract

In a recent paper, V.F. Demyanov, S. Gamidov and I. Sivelina developed an algorithm for solving optimization problems, given by smooth compositions of max-type functions.

In this paper the authors apply this algorithm to a larger class of quasidifferentiable functions.

This paper is a contribution to research on nondifferentiable optimization currently underway with the System and Decision Sciences Program.

Item Type: Monograph (IIASA Collaborative Paper)
Research Programs: System and Decision Sciences - Core (SDS)
Depositing User: IIASA Import
Date Deposited: 15 Jan 2016 01:55
Last Modified: 22 Jul 2016 09:04
URI: http://pure.iiasa.ac.at/2520

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