Login / Signup

A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis.

Eyal CohenD. Russell LukeTitus PintaShoham SabachMarc Teboulle
Published in: J. Glob. Optim. (2024)
Keyphrases
  • convergence analysis
  • heuristic methods
  • optimization problems
  • objective function
  • combinatorial optimization
  • newton method
  • dynamic programming
  • global optimization
  • hybrid algorithm
  • proximal point