Skip to content

Local Optimum

Version
v1 · 2026-08-24 · History
Prime #
965
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Optimization → Mathematics

Core Idea

A local optimum is a point best within its neighbourhood but not across the whole landscape. The structural triple is a landscape valuing each configuration, a neighbourhood relation defining a small move, and a search procedure that follows local improvements — halting wherever every neighbour is no better, even when a far better configuration exists elsewhere.

How would you explain it like I'm…

Top of a Small Hill

Imagine you climb a small hill in the fog and reach the very top, where every step around you goes down. You feel like you're at the highest place. But somewhere far away there's a much taller mountain you can't see. A Local Optimum is being at the top of your little hill while a bigger one is out there.

Best Hill, Not Biggest

A Local Optimum is the best spot in your immediate neighborhood, but not the best spot overall. Picture climbing a hilly landscape where you only ever take steps that go up. Eventually you reach a peak where every direction around you goes down, so you stop. The catch is there might be a much taller peak somewhere else, but you can't get there by only stepping uphill — you'd have to go down first to cross the valley. The surprising part: being really good at climbing the nearest hill is exactly why you get stuck on it.

The Hill-Climber's Trap

A Local Optimum is a point that is best within its neighbourhood on a landscape but not necessarily best overall. The pattern is a triple: a landscape that assigns a value to each configuration, a neighbourhood relation defining what counts as a small move, and a search procedure that follows local improvements. A configuration is a local optimum when every neighbour is no better, so the procedure halts there even though a far better configuration exists elsewhere, because from its immediate surroundings there is nowhere up to go. The sharp insight is that local improvement alone cannot find global improvement once the landscape is rugged. Strikingly, the same hill-climbing skill that found the local peak is the reason it cannot leave: escape requires a different kind of move, a non-local jump, a perturbation, or a restart, not more of the same skill.

 

A local optimum is a point that is best within its neighbourhood on a landscape but not necessarily best on the landscape as a whole. The structural pattern is a triple: a landscape that assigns a value to each candidate configuration, a neighbourhood relation that defines what counts as a small move, and a search procedure that follows local improvements. A configuration is a local optimum when every neighbour is no better; the procedure halts there even when a far better configuration exists elsewhere, because from the immediate surroundings there is nowhere up to go. The structural commitment is that local improvement alone cannot find global improvement once the landscape is rugged. The predictive content is sharp: any improvement procedure restricted to a neighbourhood, whether by design (steepest ascent), by myopia (an agent evaluating only local trade-offs), or by selection (evolution favouring the next generation), is trap-prone, and the diagnostic questions are identical across substrates: how rugged is the landscape, how local is the neighbourhood, and what escape mechanism does the procedure have? None mentions a particular substrate. The striking fact is that the same hill-climbing competence that found the local peak is why it cannot leave: the better an agent is at fast local improvement, the faster it reaches a local optimum and the more its competence is exhausted there. Escape requires a different kind of move, a non-local jump, perturbation, or restart.

Broad Use

  • Mathematical optimisation: gradient ascent on a non-convex function halts at a local maximum.
  • Machine learning: k-means halts at an initialisation-dependent local optimum, escaped by random restarts.
  • Evolutionary biology: a population climbs to a local adaptive peak, and reaching a higher peak requires crossing a fitness valley.
  • Strategy: a firm incrementally refining a product stalls on a local optimum while a clean-sheet redesign would dominate.
  • Career decisions: "a good job but not the best job" — small moves don't improve things, but a large move might.
  • Public policy: a tax code or electoral system whose defenders correctly note no small reform improves it.

Clarity

Separates "good locally" from "good globally," exposing the confusion in which a successful record of incremental improvement is taken as evidence of global optimality — when it is only evidence of effective local search.

Manages Complexity

Compresses a family of "looks maximally improved but isn't" failures under four diagnostic questions (configuration space, neighbourhood, objective, escape move) and one parallel intervention menu — restarts, perturbation, annealing, deliberate disruption, periodic redesign.

Abstract Reasoning

Supports the striking inference that the same hill-climbing competence that found the local peak is why it cannot leave it, so escape requires not more local effort but a different kind of move sized to the basin's depth.

Knowledge Transfer

  • Optimisation to strategy: "schedule exploration explicitly" transfers directly — a firm on a local optimum allocates effort to non-local search as an annealing schedule allocates temperature.
  • Biology to product design: "crossing a fitness valley" is the same as a non-incremental redesign — both require temporary worsening that is observable while the gain is conjectural.
  • Engineering to career: simulated annealing's cooling schedule ports as "explore broadly early, exploit later."

Example

k-means clustering descends the within-cluster sum-of-squares objective and halts when no reassignment lowers it — every neighbour is no better — but the result is initialisation-dependent, so the standard cure is a different kind of move: random restarts (k-means++ seeding) that sample diverse basins.

Relationships to Other Abstractions

Local relationship map for Local OptimumParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Local OptimumPRIMEPrime abstraction: Optimization — presupposesOptimizationPRIMEPrime abstraction: Optimization Landscape — is a kind of, typicalOptimizationLandscapePRIMEDomain-specific abstraction: Inframarginal analysis — presupposesInframarginalanalysisDOMAINDomain-specific abstraction: Innovator's Dilemma — is a decomposition ofInnovator'sDilemmaDOMAINDomain-specific abstraction: Local search (optimization) — is a kind ofLocal search(optimization)DOMAINDomain-specific abstraction: One-shot deviation principle — is a kind ofOne-shot deviat…DOMAINPrime abstraction: Metastability — is a kind of, typicalMetastabilityPRIME

Current abstraction Local Optimum Prime

Parents (2) — outgoing typed relations

  • Local Optimum is a kind of, typical Optimization Landscape Prime

    A local_optimum is one POINT (where local search halts) on the landscape; the optimization landscape is the whole country (basins, ridges, plateaus, connectivity).

  • Local Optimum presupposes Optimization Prime

    'Optimization is the ACTIVITY of which a local optimum is a failure MODE.' A local optimum presupposes a value landscape under improvement search — it is the trap the optimization search falls into.

Children (5) — abstractions linked here by typed relations

  • Local search (optimization) Domain-specific is a kind of Local Optimum

    It remains its own entry because its identity is fixed by the optimization problem and objective, feasible space, neighborhood operator, initialization, evaluation and acceptance rule, tie and randomization, stopping budget, local-optimum condition and performance comparison.

  • One-shot deviation principle Domain-specific is a kind of Local Optimum

    It remains its own entry because its identity is fixed by the extensive-form game, information and perfect-recall assumptions, horizon or discounting conditions, strategy profile, every subgame or information set, one-action deviation and continuation strategy and payoff comparison.

  • Metastability Prime is a kind of, typical Local Optimum

    Metastability is a local optimum in a dynamical/energy landscape held by a kinetic barrier, satisfying local_optimum's neighborhood-best-not-global-best definition.

  • Inframarginal analysis Domain-specific presupposes Local Optimum

    Inframarginal analysis solves local optima within discrete configurations before comparing them.

  • Innovator's Dilemma Domain-specific is a decomposition of Local Optimum

    Removing incumbent-management vocabulary leaves a system selecting the best reachable moves in its current neighborhood while missing a superior trajectory outside it.

Hierarchy paths (2) — routes to 2 parentless roots

Not to Be Confused With

  • Local Optimum is not Optimization because a local optimum is a point where local search stalls, whereas optimization is the activity of seeking the best configuration.
  • Local Optimum is not Equilibrium because a local optimum is a value-best-in-neighbourhood point reached by an improvement procedure, whereas an equilibrium is a balance of forces with no ranking of states by value.
  • Local Optimum is not Satisficing because a local optimum is where a procedure cannot improve further locally, whereas satisficing deliberately stops at a good-enough point.