Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Vector calculus
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Optimization === {{main|Mathematical optimization}} For a continuously differentiable [[function of several real variables]], a point {{math|''P''}} (that is, a set of values for the input variables, which is viewed as a point in {{math|'''R'''<sup>''n''</sup>}}) is '''critical''' if all of the [[partial derivative]]s of the function are zero at {{math|''P''}}, or, equivalently, if its [[gradient]] is zero. The critical values are the values of the function at the critical points. If the function is [[smooth function|smooth]], or, at least twice continuously differentiable, a critical point may be either a [[local maximum]], a [[local minimum]] or a [[saddle point]]. The different cases may be distinguished by considering the [[eigenvalue]]s of the [[Hessian matrix]] of second derivatives. By [[Fermat's theorem (stationary points)|Fermat's theorem]], all local [[maxima and minima]] of a differentiable function occur at critical points. Therefore, to find the local maxima and minima, it suffices, theoretically, to compute the zeros of the gradient and the eigenvalues of the Hessian matrix at these zeros.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)