Process / pipelineMathematical programming
二次规划 (QP)
二次规划 (QP) 是一类约束数学优化问题，其目标函数为二次函数，约束条件为线性函数。QP 由 Frank 和 Wolfe (1956) 通过其基于梯度的可行方向算法正式化，在运筹学、金融学、机器学习和工程设计等领域中，凡是需要在线性可行性条件下最小化凸（或非凸）二次成本时，QP 都扮演着基础性的角色。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Frank, M., & Wolfe, P. (1956). An algorithm for quadratic programming. Naval Research Logistics Quarterly, 3(1–2), 95–110. DOI: 10.1002/nav.3800030109 ↗
如何引用本页
ScholarGate. (2026, June 2). Quadratic Programming (QP). ScholarGate. https://scholargate.app/zh/optimization/quadratic-programming
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →