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...

Celý popis

Podrobná bibliografie

Vydáno v:	Journal of optimization theory and applications Ročník 95; číslo 3; s. 693 - 699
Hlavní autor:	Daldoul, M.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY Springer 01.12.1997 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!