| Optimization Toolbox | ![]() |
Linearly Constrained Problems
Linear constraints complicate the situation described for unconstrained minimization. However, the underlying ideas described previously can be carried through in a clean and efficient way. The large-scale methods in the Optimization Toolbox generate strictly feasible iterates:
| Preconditioned Conjugate Gradients | Linear Equality Constraints | ![]() |
Learn more about the latest releases of MathWorks products: |
| © 1994-2010 The MathWorks, Inc. - Site Help - Patents - Trademarks - Privacy Policy - Preventing Piracy - RSS |