Math 2.0

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.

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
Algorithms for constrained nonlinear programs, topic, no evidence levelAlgorithms for constr…topicCombinatorial optimization problems, topic, no evidence levelCombinatorial optimiz…topicComplexity of linear and convex programming, topic, no evidence levelComplexity of linear …topicConic and semidefinite programming, topic, no evidence levelConic and semidefinit…topicConjugate functions and Fenchel duality, topic, no evidence levelConjugate functions a…topicConvex functions on R^n, topic, no evidence levelConvex functions on R…topicDiscrete-time dynamic programming, topic, no evidence levelDiscrete-time dynamic…topicFinite-dimensional variational inequalities and complementarity, topic, no evidence levelFinite-dimensional va…topicFirst-order methods and oracle complexity, topic, no evidence levelFirst-order methods a…topicGlobal and derivative-free optimization, topic, no evidence levelGlobal and derivative…topicInteger programming, topic, no evidence levelInteger programmingtopicInterior point methods, topic, no evidence levelInterior point methodstopicLagrangian duality and saddle points, topic, no evidence levelLagrangian duality an…topicLine search, Newton and quasi-Newton methods, topic, no evidence levelLine search, Newton a…topicLinear programming, topic, no evidence levelLinear programmingtopicMultiobjective and vector optimization, topic, no evidence levelMultiobjective and ve…topicNetwork optimization, topic, no evidence levelNetwork optimizationtopicNumerical methods for optimal control, topic, no evidence levelNumerical methods for…topicOperator splitting and proximal algorithms, topic, no evidence levelOperator splitting an…topicOptimality conditions for nonlinear programs, topic, no evidence levelOptimality conditions…topicOptimization in infinite dimensions and on manifolds, topic, no evidence levelOptimization in infin…topicOptimization problems, topic, no evidence levelOptimization problemstopicPolyhedral combinatorics, topic, no evidence levelPolyhedral combinator…topicPolynomial optimization and sums of squares, topic, no evidence levelPolynomial optimizati…topicQuadratic, fractional and other special programs, topic, no evidence levelQuadratic, fractional…topicRobust and distributionally robust optimization, topic, no evidence levelRobust and distributi…topicStochastic programming and stochastic optimization, topic, no evidence levelStochastic programmin…topicSubdifferentials of convex functions, topic, no evidence levelSubdifferentials of c…topicSubmodular and discrete convex optimization, topic, no evidence levelSubmodular and discre…topicThe simplex method and decomposition, topic, no evidence levelThe simplex method an…topic
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Algorithms for constrained nonlinear programs topic member
  2. Combinatorial optimization problems topic member
  3. Complexity of linear and convex programming topic member
  4. Conic and semidefinite programming topic member
  5. Conjugate functions and Fenchel duality topic member
  6. Convex functions on R^n topic member
  7. Discrete-time dynamic programming topic member
  8. Finite-dimensional variational inequalities and complementarity topic member
  9. First-order methods and oracle complexity topic member
  10. Global and derivative-free optimization topic member
  11. Integer programming topic member
  12. Interior point methods topic member
  13. Lagrangian duality and saddle points topic member
  14. Line search, Newton and quasi-Newton methods topic member
  15. Linear programming topic member
  16. Multiobjective and vector optimization topic member
  17. Network optimization topic member
  18. Numerical methods for optimal control topic member
  19. Operator splitting and proximal algorithms topic member
  20. Optimality conditions for nonlinear programs topic member
  21. Optimization in infinite dimensions and on manifolds topic member
  22. Optimization problems topic member
  23. Polyhedral combinatorics topic member
  24. Polynomial optimization and sums of squares topic member
  25. Quadratic, fractional and other special programs topic member
  26. Robust and distributionally robust optimization topic member
  27. Stochastic programming and stochastic optimization topic member
  28. Subdifferentials of convex functions topic member
  29. Submodular and discrete convex optimization topic member
  30. The simplex method and decomposition topic member
About this page
TagBZZ0NSJTFB
URIm2://BZZ0NSJTFB
Kindtopic
WritingW0 stub
MSC90Cxx, 49Mxx
Changed17 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.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe whole nodetamnd

What links here

Nodes in this topic