Press Solve.
Method
The Nelder–Mead simplex method uses only function values: it reflects, expands, contracts and shrinks a simplex of n + 1 points around the best vertex. It needs no derivatives, but converges only to a local optimum and slowly in high dimension. The final gradient norm (central differences) checks that the point is stationary. Maximisation minimises −f.
Computed in your browser with double-precision arithmetic; nothing is sent to a server. Check results by substituting them back.