| 製品・サービス | 産業 | アカデミック | サポート | ユーザコミュニティ | 企業情報 | |
| Download Product Updates | | | Contact sales | | | Trial software |
| Documentation → Optimization Toolbox |
| Contents | Index |
| Learn more about Optimization Toolbox |
This table summarizes what's new in Version 5.0 (R2010a):
| New Features and Changes | Version Compatibility Considerations | Fixed Bugs and Known Problems | Related Documentation at Web Site |
|---|---|---|---|
| Yes Details below | Yes Summary | Bug
Reports Includes fixes | Printable Release Notes: PDF |
fmincon has a new algorithm called SQP for Sequential Quadratic Programming. The algorithm has the following features:
Honors bounds at all iterations
Attempts a different step if one leads to an objective or constraint function returning a NaN, Inf, or complex result
Fast internal linear algebra for solving quadratic programs
Choose the algorithm at the command line by setting the Algorithm option to 'sqp' with optimset. For more information about the algorithm, see fmincon SQP Algorithm in the Optimization Toolbox™ documentation.
The lsqnonneg solver no longer accepts a start point x0 as an optional input.
The Optimization Tool no longer has an input region for accepting a start point. If you import or run a problem that contains a start point x0, MATLAB issues a warning. Also, the Optimization Tool and lsqnonneg ignore x0, and instead use a start point of a vector of zeroes. If you export a problem structure from the Optimization Tool, there is no x0 field.
![]() | Optimization Toolbox Release Notes | Version 4.3 (R2009b) Optimization Toolbox Software | ![]() |

Learn how to use optimization to solve systems of equations, fit models to data, or optimize system performance.
Get free kit| © 1984-2010- The MathWorks, Inc. - Site Help - Patents - Trademarks - Privacy Policy - Preventing Piracy - RSS |