An Accelerated Method for Minimizing a Convex Function of Two Variables

Paizerova FA (1985). An Accelerated Method for Minimizing a Convex Function of Two Variables. IIASA Collaborative Paper. IIASA, Laxenburg, Austria: CP-85-017

[img]
Preview
Text
CP-85-017.pdf

Download (312kB) | Preview

Abstract

The author considers the problem of minimizing a convex function of two variables without computing the derivatives or (in the nondifferentiable case) the subgradients of the function, and suggests two algorithms for doing this. Such algorithms could form an integral part of new methods for minimizing a convex function of many variables based on the solution of a two-dimensional minimization problem at each step (rather than on line-searches, as in most existing algorithms).

This is a contribution to research on nonsmooth optimization currently underway in System and Decision Sciences Program Core.

Item Type: Monograph (IIASA Collaborative Paper)
Research Programs: System and Decision Sciences - Core (SDS)
Depositing User: IIASA Import
Date Deposited: 15 Jan 2016 01:56
Last Modified: 18 Nov 2016 17:12
URI: http://pure.iiasa.ac.at/2731

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