Corpus ID: 119313553

Algorithms for Convex Quadratic Programming

@inproceedings{Hungerlander2014AlgorithmsFC,
  title={Algorithms for Convex Quadratic Programming},
  author={Philipp Hungerlander},
  year={2014}
}
  • Philipp Hungerlander
  • Published 2014
  • Mathematics
  • The main contribution of this thesis is the development of a new algorithm for solving convex quadratic programs. It consists in combining the method of multipliers with an infeasible active-set method. Our approach is iterative. In each step we calculate an augmented Lagrange function. Then we minimize this function using an infeasible active-set method that was already successfully applied to similar problems. After this we update the Lagrange multiplier for the equality constraints. Finally… CONTINUE READING
    3 Citations

    Tables from this paper.