object

nelder_mead(Problem)

• Problem - Problem object implementing local_optimization_problem_protocol.

Nelder-Mead (downhill simplex) derivative-free local optimizer for continuous problems. Supports optional box constraints via projection, minimization and maximization, and the standard reflection / expansion / contraction / shrink operators.

Availability:

logtalk_load(local_optimization(loader))

Author: Paulo Moura

Version: 1:0:0

Date: 2026-09-03

Compilation flags:

static, context_switching_calls

Imports:

public local_optimization_solver(Problem)

Uses:

linear_algebra

list

pairs

Remarks:

• Algorithm: Classic Nelder-Mead simplex method. An optional adaptive-parameter variant (Gao-Han) can be selected with the adaptive(true) option.

• Bounds: When the problem defines position_bounds/1, trial points are projected onto the box after every operator.

• Initial simplex: Built from the problem initial_point/1 by stepping along each coordinate axis. The step size is controlled by the initial_step(S) option (default 0.05 of each finite range, or an absolute 0.05 when unbounded).

Inherited public predicates:

 check_option/1  check_options/1  default_option/1  default_options/1  option/2  option/3  run/2  run/3  run/4  valid_option/1  valid_options/1

Public predicates

(no local declarations; see entity ancestors if any)

Protected predicates

(no local declarations; see entity ancestors if any)

Private predicates

(no local declarations; see entity ancestors if any)

Operators

(none)

See also

local_optimization_problem_protocol, local_optimization_solver(Problem), gradient_descent(Problem)