基于问题的二次规划

Quadratic Programming with Bound Constraints: Problem-Based

Shows how to solve a problem-based quadratic programming problem with bound constraints using different algorithms.

Large Sparse Quadratic Program, Problem-Based

Shows how to solve a large sparse quadratic program using the problem-based approach.

Bound-Constrained Quadratic Programming, Problem-Based

Example showing large-scale problem-based quadratic programming.

Quadratic Programming for Portfolio Optimization, Problem-Based

Example showing problem-based quadratic programming on a basic portfolio model.

基于求解器的二次规划

Quadratic Minimization with Bound Constraints

Example of quadratic programming with bound constraints and various options.

Quadratic Programming with Many Linear Constraints

This example shows the benefit of the active-set algorithm on problems with many linear constraints.

Quadratic Minimization with Dense, Structured Hessian

Example showing how to save memory in a structured quadratic program.

Large Sparse Quadratic Program with Interior Point Algorithm

Example showing how to save memory in a quadratic program by using a sparse quadratic matrix.

Bound-Constrained Quadratic Programming, Solver-Based

Example showing solver-based large-scale quadratic programming.

Quadratic Programming for Portfolio Optimization Problems, Solver-Based

Example showing solver-based quadratic programming on a basic portfolio model.

代码生成

Code Generation for quadprog Background

Prerequisites to generate C code for quadratic optimization.

Generate Code for quadprog

Learn the basics of code generation for the quadprog optimization solver.

Optimization Code Generation for Real-Time Applications

Explore techniques for handling real-time requirements in generated code.

基于问题的算法

Problem-Based Optimization Algorithms

How the optimization functions and objects solve optimization problems.

Supported Operations on Optimization Variables and Expressions

Lists all available mathematical and indexing operations on optimization variables and expressions.

算法和选项

二次规划算法

在仅具有线性和边界约束的情况下在 n 个维度中最小化二次目标函数。

优化选项参考

了解优化选项。