Login / Signup

On the Approximate Solution of a Class of Large Discrete Quadratic Programming Problems by Delta Sigma Modulation: The Case of Circulant Quadratic Forms.

Sergio CallegariFederico BizzarriRiccardo RovattiGianluca Setti
Published in: IEEE Trans. Signal Process. (2010)
Keyphrases
  • quadratic programming problems
  • delta sigma
  • convex sets
  • computational complexity
  • noise shaping
  • feature extraction
  • finite number
  • genetic algorithm
  • low cost
  • equality constraints
  • systems of linear equations