Login / Signup

A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs.

Enrico BettiolLucas LétocartFrancesco RinaldiEmiliano Traversi
Published in: Comput. Optim. Appl. (2020)
Keyphrases
  • quadratic program
  • convex optimization
  • convex optimization problems
  • upper bound
  • approximation algorithms
  • machine learning
  • linear programming
  • cross validation