Optimization Tree

From NEOS

Jump to: navigation, search

Read this introduction to Optimization, and follow the links below to specific optimization paradigms, major algorithms, and solvers.

Discrete and Integer Optimization

  • Integer Programming
    • Mixed Integer Programming \to Mixed Integer Nonlinear Programming
    • Stochastic Integer Programming
    • Special Problems

Continuous Optimization

  • Unconstrained Optimization
    • Bound Constrained Optimization
  • Constrained Optimization
    • Nonlinearly Constrained Optimization \to Nonlinear Equations \to Nonlinear Least Squares
    • Quadratic Programming \to Linear Programming \to Network Programming
    • Semidefinite Programming
    • Stochastic Programming
    • Global Optimization
    • Nondifferentiable Optimization
  • Complementarity Constraints
    • Nonlinear Complementarity Problems \to Linear Complementarity Problems
    • Mathematical Programs with Complementarity Constraints
  • PDE Constrained Optimization
  • Semiinfinite Programming

If you'd like to contribute a description of one of the areas that we don't presently cover, please email Sven Leyffer.

Retrieved from "http://wiki.mcs.anl.gov/NEOS/index.php/Optimization_Tree"
Views
  • Page
  • Discussion
  • View source
  • History
Personal tools
  • 38.107.191.101
  • Talk for this IP
  • Log in
Navigation
  • NEOS Wiki
  • NEOS Server
  • Optimization Tree
  • Software Guide
  • Optimization FAQs
  • Case Studies
  • Test Problems
  • Applications
  • Views and News
  • Editorial Board
  • Recent changes
  • Help
 
Toolbox
  • What links here
  • Related changes
  • Special pages
  • Printable version
  • Permanent link
Powered by MediaWiki
  • This page was last modified on 19 March 2007, at 03:22.
  • This page has been accessed 10,618 times.
  • Privacy policy
  • About NEOS
  • Disclaimers