1638 CEMultiple formations from ancient reflected paths and 17th-century extrema and fastest curves to modern variation, planning, and stochastic search
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
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∗)=0⟹x∗ 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
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
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
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
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
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
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.