Finite Convergence of the Partial Inverse Algorithm

In Refs. 1-2, Lefebvre and Michelot proved the finite convergence of the partial inverse algorithm applied to a polyhedral convex function by means of some suitable tools of convex analysis. They obtained their result under some assumptions on the primal and dual solution sets. The aim of this note...

Full description

Bibliographic Details

Published in:	Journal of optimization theory and applications Vol. 95; no. 3; pp. 693 - 699
Main Author:	Daldoul, M.
Format:	Journal Article
Language:	English
Published:	New York, NY Springer 01.12.1997 Springer Nature B.V
Subjects:	Applied sciences Exact sciences and technology Operational research and scientific management Operational research. Management science Optimization. Search problems Subdifferential Primal dual method Convex function Proximal point method Algorithm Optimization Convergence
ISSN:	0022-3239, 1573-2878
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!