Login / Signup

A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results.

Alfred Auslender
Published in: Math. Program. (2013)
Keyphrases
  • minimization problems
  • cost function
  • dynamic programming
  • computer vision
  • lower bound
  • pairwise
  • segmentation method
  • convergence rate