Zahri-Edu University

Equation Solver › Optimisation

solver.zahri-edu.net

Nonlinear optimisation

min f(x₁, …, xₙ)

Unconstrained minimisation or maximisation by Nelder–Mead, with gradient check and contour heat map.

Objective

Variables x, y, z, w (as many as start values).

Starting point and tolerance

Comma-separated values, one per variable (1 to 4).

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.

Other solvers