Login / Signup

A new linesearch method for quadratically constrained convex programming.

Aaron Melman
Published in: Oper. Res. Lett. (1994)
Keyphrases
  • special case
  • dynamic programming
  • support vector machine
  • convex programming
  • linear programming
  • convex optimization
  • computational complexity
  • denoising
  • natural images
  • spectral clustering
  • convergence rate