Scholarlink

<p>In this work we propose and analyze a projected Levenberg–Marquardt method for solving completely positive matrix factorization problems. Instead of computing the exact Levenberg–Marquardt direction, we introduce an inexact direction which simplifies the calculations and reduces the computational cost. Global convergence results are established for the proposed method endowed with a non-monotone line search. A series of numerical experiments on different classes of the problem are carried out and indicate that the new Projected Inexact Levenberg–Marquardt algorithm is competitive with well-established alternatives such as algorithms based on proximal gradient or alternating minimization methods.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A Projected Inexact Levenberg-Marquardt Method for the Completely Positive Matrix Factorization

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年3月14日

查看全文
  • Roger Behling,
  • Douglas Gonçalves,
  • Hugo Lara,
  • Harry Oviedo

摘要

In this work we propose and analyze a projected Levenberg–Marquardt method for solving completely positive matrix factorization problems. Instead of computing the exact Levenberg–Marquardt direction, we introduce an inexact direction which simplifies the calculations and reduces the computational cost. Global convergence results are established for the proposed method endowed with a non-monotone line search. A series of numerical experiments on different classes of the problem are carried out and indicate that the new Projected Inexact Levenberg–Marquardt algorithm is competitive with well-established alternatives such as algorithms based on proximal gradient or alternating minimization methods.