Operations research, mathematical programming Topic
Optimization
Summary
Optimization is the study of how to find the best point of a set with respect to a given objective. An optimization problem asks for a point that minimizes a function over a feasible set, and equations and inequalities usually describe this set. Optimization problems arise in engineering, economics, statistics and machine learning, and convexity often decides whether a problem is tractable. Fermat and Lagrange gave the first conditions for extrema, and the work of Kantorovich and Dantzig on linear programming in the 1940s started the modern subject. This topic collects the optimization pages of math2: convex analysis and duality, optimality conditions, linear, integer, conic and polynomial programming, combinatorial optimization, the algorithms and their complexity, and optimization under uncertainty and with several objectives. Operations research, game theory, the calculus of variations and optimal control, and convex and discrete geometry have their own topics.
Remarks
Sub-areas
- Optimization problems
- Convex functions on R^n
- Subdifferentials of convex functions
- Conjugate functions and Fenchel duality
- Lagrangian duality and saddle points
- Optimality conditions for nonlinear programs
- Linear programming
- The simplex method and decomposition
- Complexity of linear and convex programming
- Integer programming
- Polyhedral combinatorics
- Combinatorial optimization problems
- Submodular and discrete convex optimization
- Network optimization
- Conic and semidefinite programming
- Polynomial optimization and sums of squares
- Quadratic, fractional and other special programs
- Line search, Newton and quasi-Newton methods
- First-order methods and oracle complexity
- Operator splitting and proximal algorithms
- Algorithms for constrained nonlinear programs
- Interior point methods
- Stochastic programming and stochastic optimization
- Robust and distributionally robust optimization
- Multiobjective and vector optimization
- Global and derivative-free optimization
- Finite-dimensional variational inequalities and complementarity
- Discrete-time dynamic programming
- Optimization in infinite dimensions and on manifolds
- Numerical methods for optimal control
Everything in this topic
The members of this topic and each page that they need, 30 pages in all.
Show the path as a graph
- no evidence level
- Algorithms for constrained nonlinear programs topic member
- Combinatorial optimization problems topic member
- Complexity of linear and convex programming topic member
- Conic and semidefinite programming topic member
- Conjugate functions and Fenchel duality topic member
- Convex functions on R^n topic member
- Discrete-time dynamic programming topic member
- Finite-dimensional variational inequalities and complementarity topic member
- First-order methods and oracle complexity topic member
- Global and derivative-free optimization topic member
- Integer programming topic member
- Interior point methods topic member
- Lagrangian duality and saddle points topic member
- Line search, Newton and quasi-Newton methods topic member
- Linear programming topic member
- Multiobjective and vector optimization topic member
- Network optimization topic member
- Numerical methods for optimal control topic member
- Operator splitting and proximal algorithms topic member
- Optimality conditions for nonlinear programs topic member
- Optimization in infinite dimensions and on manifolds topic member
- Optimization problems topic member
- Polyhedral combinatorics topic member
- Polynomial optimization and sums of squares topic member
- Quadratic, fractional and other special programs topic member
- Robust and distributionally robust optimization topic member
- Stochastic programming and stochastic optimization topic member
- Subdifferentials of convex functions topic member
- Submodular and discrete convex optimization topic member
- The simplex method and decomposition topic member
About this page
| Tag | BZZ0NSJTFB |
|---|---|
| URI | m2://BZZ0NSJTFB |
| Kind | topic |
| Writing | W0 stub |
| MSC | 90Cxx, 49Mxx |
| Changed | 17 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a same_as or a source (0 of 1)
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
History
Each change to this page, from its provenance log. A change by an agent names its run.
| Date | Change | Field | By |
|---|---|---|---|
| 2026-11-17 | add | the whole node | tamnd |
What links here
Nodes in this topic
- Optimization problems
- Convex functions on R^n
- First-order methods and oracle complexity
- Conjugate functions and Fenchel duality
- Quadratic, fractional and other special programs
- Finite-dimensional variational inequalities and complementarity
- Conic and semidefinite programming
- Complexity of linear and convex programming
- Discrete-time dynamic programming
- Line search, Newton and quasi-Newton methods
- Subdifferentials of convex functions
- Polynomial optimization and sums of squares
- Operator splitting and proximal algorithms
- Submodular and discrete convex optimization
- Interior point methods
- Multiobjective and vector optimization
- Network optimization
- Linear programming
- Algorithms for constrained nonlinear programs
- Optimality conditions for nonlinear programs
- Combinatorial optimization problems
- Lagrangian duality and saddle points
- Polyhedral combinatorics
- Integer programming
- Robust and distributionally robust optimization
- Optimization in infinite dimensions and on manifolds
- The simplex method and decomposition
- Stochastic programming and stochastic optimization
- Numerical methods for optimal control
- Global and derivative-free optimization