FINITE TERMINATION OF THE PROXIMAL POINT ALGORITHM

被引：102

作者：

FERRIS, MC

机构：

[1] Computer Sciences Department, University of Wisconsin, Madison, 53706, WI

来源：

MATHEMATICAL PROGRAMMING | 1991年 / 50卷 / 03期

关键词：

SHARP MINIMA; PROXIMAL POINT; FINITE TERMINATION;

D O I：

10.1007/BF01594944

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

This paper concerns the notion of a sharp minimum on a set and its relationship to the proximal point algorithm. We give several equivalent definitions of the property and use the notion to prove finite termination of the proximal point algorithm.

引用

页码：359 / 366

页数：8

共 12 条

[1]

Bertsekas D.P., 1989, PARALLEL DISTRIBUTED

[2]

Brezis H, 1973, LECT NOTES MATH, V5

[3]

BURKE JV, 1991, UNPUB SHARPNESS FUNC

[4]

DELEONE R, 1988, OPTIMIZATION PARALLE, V304, P103

[5] VARIATIONAL PRINCIPLE [J].

EKELAND, I .

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1974, 47 (02) :324-353

[6]

Ferris M.C., 1988, 779 U WISC COMP SCI

[7]

MANGASARIAN OL, 1984, MATH PROGRAM STUD, V22, P206, DOI 10.1007/BFb0121017

[8] ERROR-BOUNDS FOR NONDEGENERATE MONOTONE LINEAR COMPLEMENTARITY-PROBLEMS [J].

MANGASARIAN, OL .

MATHEMATICAL PROGRAMMING, 1990, 48 (03) :437-445

[9]

MOREAU J., 1965, B LLETIN SOCI T MATH, V93, P273, DOI 10.24033/bsmf.1625

[10]

POLYAK B. T., 1972, EKON MATEM MET, V8, P740

← 1 2 →