A structured visual guide to the major mathematical areas and their relationships.
Search by code, branch, topic, subtopic, or a keyword from the descriptions.
This subtopic introduces the core ideas in numerical methods, including foundational concepts, standard methods, and the main questions used to organize the area. Typical uses include building mathematical background, framing related research problems, and supporting applications in neighboring fields where these concepts provide useful structure.
This topic studies algorithms that discretize first-order optimality conditions, often turning control problems into nonlinear systems to solve.
Used for solving realistic optimal control and inverse problems numerically.
Newton-type methods exploit local derivatives to converge rapidly to stationary points or optimal controls in nonlinear optimization.
Ideal for smooth, well-conditioned optimization problems.
Relaxation methods progressively improve approximate solutions by replacing difficult problems with easier, related ones.
Wikipedia: Relaxation (iterative method)
Useful for large-scale or difficult nonlinear problems.
This topic studies how continuous control problems are approximated by discrete-time or finite-dimensional models for computation.
Wikipedia: Discrete optimization
Needed for practical algorithms in control and PDE optimization.
Decomposition methods break large control problems into smaller subproblems that can be solved iteratively or in parallel.
Wikipedia: Decomposition method
Useful for large-scale distributed optimization problems.
Duality-based methods exploit convex conjugates and Lagrangian formulations to solve or analyze optimization problems more effectively.
Wikipedia: Duality (optimization)
Widely applied in convex optimization, economics, and control.
This broad area collects numerical approaches that do not fit a single template but share the goal of approximating variational problems reliably.
Useful for nonstandard variational schemes and computational experiments.
This topic uses nonlinear programming formulations and solvers to compute minimizers of variational and control problems.
Wikipedia: Nonlinear programming
Common in engineering optimization and optimal control computation.
This topic focuses on the numerical solution of optimization problems whose constraints are PDEs, requiring sophisticated discretization and solver strategies.
Wikipedia: PDE-constrained optimization
Used for inverse problems, flow control, and design under PDE constraints.