Finite convergence of the partial inverse algorithm

DOI10.1023/A:1022634208371MaRDI QIDQ1379940zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

convex analysisproximal point algorithmlocally polyhedral convex functionpartial inverse algorithm

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3982414 (Why is no real title available?)
• scientific article; zbMATH DE number 4043635 (Why is no real title available?)
• A primal-dual algorithm for the fermat-weber problem involving mixed gauges
• A primal-dual projection method for solving systems of linear inequalities
• On Fixed Points of Non-Expansive Piecewise Isometric Mappings
• Partial inverse of a monotone operator

Cited in

(2)

• scientific article; zbMATH DE number 4121779 (Why is no real title available?)
• scientific article; zbMATH DE number 4043635 (Why is no real title available?)

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)