Convex optimization problem which has Objective function is convex quadratic and constraint functions are all affine Quadratic programmingQuadratic programming (QP) is the process of solving certain mathematical optimization problems involving quadratic functions. Specifically, one seeks to optimize (minimize or maximize) a multivariate quadratic function subject to linear constraints on the variables. Quadratic programming is a type of nonlinear programming.https://en.wikipedia.org/wiki/Quadratic_programming05-02 Quadratic Programming (QP)[https://convex-optimization-for-all.github.io/](https://convex-optimization-for-all.github.io/) …https://wikidocs.net/1785205-02 Quadratic Programming (QP) · 모두를 위한 컨벡스 최적화https://convex-optimization-for-all.github.io/contents/chapter05/2021/02/08/05_02_Quadratic_Programming_(QP)/[최적화] Quadratic program저번 최적화 포스팅에 이어 이번에는 quadratic program을 정리해보려고 한다. 본 내용이 이 글을 읽는 분들에게 도움이 되었으면 좋겠다.https://velog.io/@wjleekr927/Quadratic-program