Constrained tuning: Difference between revisions

m Formatting
Sintel (talk | contribs)
mNo edit summary
Line 169: Line 169:
Analytical solutions exist for Euclidean (''L''<sup>2</sup>) tunings, see [[Constrained tuning/Analytical solution to constrained Euclidean tunings]].  
Analytical solutions exist for Euclidean (''L''<sup>2</sup>) tunings, see [[Constrained tuning/Analytical solution to constrained Euclidean tunings]].  


==== Method of Lagrange multiplier ====
==== Method of Lagrange multipliers ====
It can also be solved in the {{w|Lagrange multiplier|method of Lagrange multiplier}}. The solution is given by
It can also be solved analytically using the {{w|Lagrange multipliers|method of Lagrange multipliers}}. The solution is given by:


<math>\displaystyle
<math>\displaystyle
Line 189: Line 189:
</math>
</math>


which is almost an analytical solution. Notice we introduced the vector of lagrange multipliers ''Λ'', with length equal to the number of constraints. The lagrange multipliers have no concrete meaning for the resulting tuning, so they can be discarded.
Notice we introduced the vector of lagrange multipliers ''Λ'', with length equal to the number of constraints. The lagrange multipliers have no concrete meaning for the resulting tuning, so they can be discarded.


=== Simple fast closed-form algorithm ===
=== Simple fast closed-form algorithm ===