Finite convergence of the partial inverse algorithm

DOI10.1023/A:1022634208371zbMATH Open0911.90275OpenAlexW1552059171MaRDI QIDQ1379940FDOQ1379940

Authors: M. Daldoul 

Publication date: 5 May 1999

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022634208371

Recommendations

• scientific article; zbMATH DE number 4043635
• scientific article; zbMATH DE number 3982414
• Publication:4735044
• Partially finite convex programming. I: Quasi relative interiors and duality theory

zbMATH Keywords

convex analysisproximal point algorithmlocally polyhedral convex functionpartial inverse algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52)

Cites Work

• A primal-dual projection method for solving systems of linear inequalities
• A primal-dual algorithm for the fermat-weber problem involving mixed gauges
• On Fixed Points of Non-Expansive Piecewise Isometric Mappings
• Partial inverse of a monotone operator
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Finite convergence of the partial inverse algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379940)