Analysis · Concept hubDeep story

Optimization

1638 CEMultiple formations from ancient reflected paths and 17th-century extrema and fastest curves to modern variation, planning, and stochastic search

Through Optimization: How can instantaneous change and long accumulation become one language?

Follow the languages built to calculate a world that will not stand still, from planets and fluids to waves, optimization, and chaos.

This voyage is an editorial path for understanding, not a claim of direct historical influence or sole invention.

Understand it in one breath

Find a choice that minimizes or maximizes an objective subject to constraints. Linear programming, gradient methods, and stochastic search provide different guarantees for different structures. In a convex problem every local minimum is global; in a nonconvex problem such as neural-network training, a zero gradient alone is no certificate of optimality. Logistics, design, statistics, and learning supply many applications.

At a glance

-3-2-10123-8-6-4-202
f(x) = 0.3x⁴ - 3x²

Concept

The mathematics of minimizing or maximizing a stated objective subject to constraints. An optimum exists only after “better” and “feasible” are specified; local versus global, exact versus approximate, computable versus socially desirable remain distinct.

Key formula

f convex,  f(x)=0x is a global minimumf \text{ convex},\; \nabla f(x^*) = 0 \Longrightarrow x^* \text{ is a global minimum}

Ports in time

This concept was not invented in one instant

Follow the scenes to see problems, notation, standards of proof, and applications changing across different times and places.

1
AD 1638Scene 1 / 6Continue through the world of this year

Fermat — extrema before differential notation

Fermat’s adequality compared nearby expressions to solve many tangent and extremum problems. It did not state the modern gradient-equals-zero rule or supply a sufficient condition covering boundaries and nondifferentiable points.

No reliable place is given, so time continues without an invented pin

Continue through the world of this year
2
AD 1744Scene 2 / 6Continue through the world of this year

Euler — choosing an entire function

Methodus inveniendi systematized extrema of quantities such as length and time attached to curves. Lausanne marks publication, and Lagrange and others later developed the formalism.

No reliable place is given, so time continues without an invented pin

Continue through the world of this year
3
AD 1847Scene 3 / 6Continue through the world of this year

Cauchy — descending by repeated negative gradients

Cauchy proposed a steepest-descent procedure for simultaneous equations. Step size, initialization, and landscape determine whether it converges, stalls, or diverges; global optimality is not automatic.

No reliable place is given, so time continues without an invented pin

Continue through the world of this year
4
AD 1939Scene 4 / 6Continue through the world of this year

Karush and Kantorovich — constraints and resource allocation

Karush studied conditions for inequality constraints while Kantorovich modeled linear production planning in a different institution. Their work connects to KKT and simplex without becoming one person’s or one city’s invention.

No reliable place is given, so time continues without an invented pin

Continue through the world of this year
5
AD 1951Scene 5 / 6Continue through the world of this year

Robbins and Monro — approximation through noise

Noisy observations and properly diminishing steps could estimate a target without exact function values. This is an important ancestor of stochastic gradient methods, not an identical modern mini-batch algorithm.

No reliable place is given, so time continues without an invented pin

Continue through the world of this year
6
AD 2012Scene 6 / 6Continue through the world of this year

AlexNet — combining data, GPUs, and loss optimization

Large image data, convolutional networks, GPUs, backpropagation, and stochastic optimization sharply improved benchmark performance. Minimizing that loss did not automatically optimize intelligence, truth, or fairness.

No reliable place is given, so time continues without an invented pin

Continue through the world of this year

Modern applications

Neural-network training, airline scheduling, logistics, design, energy systems, portfolios, and game AI. Results remain conditional on objectives, constraints, data, uncertainty, algorithms, and stopping rules; omitted costs and fairness do not optimize themselves.

Beyond MathVoyage

Curated sources and problems. Bring one discovery back from OEIS, Project Euler, MathOverflow, or arXiv.

No concept belongs to one person

Follow people who played different roles

These are not inventor credits. They are different ports: opening a problem, sharpening a language, or carrying it into another world.

Number lenses

A concept looks different when its world of numbers changes

These numbers are editorial lenses for the voyage, not required prerequisites.

Concept genealogy

What supports it, and what does it open?

Concepts arriving from before

Current port

Optimization

Concepts opened from here

No direct successor port is curated yet.

Only direct editorial links are shown; this is not a complete learning order or historical influence line.