A hybrid gradient method for strictly convex quadratic programming.
Harry OviedoOscar S. DalmauRafael HerreraPublished in: Numer. Linear Algebra Appl. (2021)
Keyphrases
- quadratic programming
- gradient method
- strictly convex
- newton method
- linear programming
- convergence rate
- step size
- negative matrix factorization
- support vector machine
- optimization methods
- ls svm
- linear program
- neural network
- convergence analysis
- dynamic programming
- convergence speed
- global convergence
- linear svm
- nonlinear programming
- objective function
- genetic algorithm