About 22 results
Open links in new tab
  1. Quadratic programming - Cornell University

    Oct 17, 2020 · A quadratic program is an optimization problem that comprises a quadratic objective function bound to linear constraints. 1 Quadratic Programming (QP) is a common …

  2. Sequential quadratic programming - Cornell University

    Apr 1, 2022 · Sequential quadratic programming (SQP) is a class of algorithms for solving non-linear optimization problems (NLP) in the real world. It is powerful enough for real problems …

  3. Quadratic constrained quadratic programming - Cornell University ...

    Dec 15, 2024 · A Quadratically Constrained Quadratic Program (QCQP) can be defined as an optimization problem where the objective function and the constraints are quadratic. It …

  4. Quadratic assignment problem - Cornell University

    Dec 14, 2020 · The Quadratic Assignment Problem (QAP), discovered by Koopmans and Beckmann in 1957, is a mathematical optimization module created to describe the location of …

  5. Frank-Wolfe - Cornell University Computational Optimization …

    Dec 15, 2021 · The formulation of co-localization using the Frank-Wolfe algorithm involves minimizing a standard quadratic programming problem and reducing it to a succession of …

  6. Duality - Cornell University Computational Optimization Open …

    Dec 4, 2024 · Solving a Linear Programming problem by the Simplex Method gives you a solution of its dual as a by-product. This simplex algorithm tries to reduce the infeasibility of the dual …

  7. Mixed-integer linear fractional programming (MILFP)

    Dec 21, 2020 · The mixed-integer linear fractional programming (MILFP) is a kind of mixed-integer nonlinear programming (MINLP) that is widely applied in chemical engineering, …

  8. Geometric programming - Cornell University Computational …

    Dec 11, 2021 · Though a number of practical problems are not equivalent to geometric programming, geometric programming is generally considered an effective solution for …

  9. Trust-region methods - Cornell University Computational …

    Dec 13, 2024 · The central core of trust region methods lies in the idea of constructing a simplified model — often a quadratic approximation — that represents the objective function near the …

  10. Simplex algorithm - Cornell University Computational …

    Oct 5, 2021 · Besides solving the problems, the Simplex method can also enlighten the scholars with the ways of solving other problems, for instance, Quadratic Programming (QP). For some …

Refresh