User:Zarzuelazen/Books/Reality Theory: Optimization

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Game of life animated LWSS.gif
This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance).

Edit this book: Book Creator · Wikitext
Select format to download:

PDF (A4) · PDF (Letter)

Order a printed copy from these publishers: PediaPress
About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] Recent Changes ]


Reality Theory: Optimization[edit]

A* search algorithm
Action selection
Active set method
Adaptive system
AIXI
AlphaGo
AlphaGo versus Lee Sedol
AlphaGo Zero
AlphaZero
Alpha–beta pruning
Ant colony optimization algorithms
Any-angle path planning
Apprenticeship learning
Approximate max-flow min-cut theorem
Approximation algorithm
Arg max
Artificial intelligence in video games
Artificial life
Assignment problem
Attractor
Auction algorithm
Augmented Lagrangian method
Automated planning and scheduling
Automatic differentiation
Autonomous system (mathematics)
B*
Backjumping
Backmarking
Backtracking
Barrier function
Base flow (random dynamical systems)
Bayesian optimization
Beam search
Behavior tree (artificial intelligence, robotics and control)
Behavior-based robotics
Belief–desire–intention software model
Bellman equation
Bellman–Ford algorithm
Beltrami identity
Bernoulli scheme
Best-first search
Bidirectional search
Bifurcation diagram
Bifurcation theory
Bin packing problem
Bitboard
Board representation (chess)
Borůvka's algorithm
Branch and bound
Breadth-first search
Brute-force search
Butterfly effect
Calculus of variations
Cantor set
Catastrophe theory
Causal loop diagram
Causal system
Cellular evolutionary algorithm
Chaos theory
Chess engine
Chess opening book (computers)
Christofides algorithm
Chromosome (genetic algorithm)
Circulation problem
Collective intelligence
Combinatorial optimization
Combinatorial search
Complementarity theory
Complex adaptive system
Complex system
Complexity
Computational geometry
Computer bridge
Computer chess
Computer Go
Computer poker player
Computer shogi
Condition number
Conflict resolution strategy
Conic optimization
Constrained optimization
Constraint (mathematics)
Constraint Composite Graph
Constraint graph
Constraint learning
Constraint satisfaction
Constraint satisfaction problem
Convex hull
Convex optimization
Coordinate descent
Coupled map lattice
Covering problems
Critical point (mathematics)
Cross-entropy method
Crossover (genetic algorithm)
Curtis–Hedlund–Lyndon theorem
Cutting stock problem
Cutting-plane method
Cybernetics
D*
Deep Blue (chess computer)
Deep Blue versus Garry Kasparov
Delaunay triangulation
Depth-first search
Derivative test
Derivative-free optimization
Deterministic system
Differential evolution
Dijkstra's algorithm
Dinic's algorithm
Discrete time and continuous time
Domain decomposition methods
Duality (optimization)
Duality gap
Dynamic programming
Dynamical system
Dynamical system (definition)
Dynamical systems theory
Edge cover
Edge of chaos
Edmonds–Karp algorithm
End-to-end reinforcement learning
Endgame tablebase
Equidistributed sequence
Equilibrium point
Ergodic theory
Ergodicity
Euler–Lagrange equation
Evaluation function
Evolution strategy
Evolutionary algorithm
Evolutionary computation
Evolutionary multimodal optimization
Expectiminimax tree
Exploration problem
Facility location problem
Farkas' lemma
Feasible region
Feedback
Feigenbaum constants
Fermat's theorem (stationary points)
Finite difference
Finite difference method
Fitness approximation
Fitness function
Fitness landscape
Fitness proportionate selection
Flow (mathematics)
Flow network
Flow shop scheduling
Floyd–Warshall algorithm
Ford–Fulkerson algorithm
Fractal
Fractal dimension
Fractional programming
Functional derivative
Fuzzy control system
Gaussian adaptation
Gene expression programming
General game playing
Genetic algorithm
Genetic algorithm scheduling
Genetic operator
Genetic programming
Genetic representation
Geometric programming
Global optimization
Gradient descent
Grammatical evolution
Graph traversal
Greedy algorithm
Guided Local Search
Gödel machine
Heteroclinic orbit
Heuristic (computer science)
Hierarchical control system
Hierarchical task network
Hill climbing
Homoclinic orbit
Horizon effect
Human-based genetic algorithm
Human–computer chess matches
Hyper-heuristic
Hyperbolic set
Incremental heuristic search
Independent set (graph theory)
Infinite-dimensional optimization
Inflection point
Inheritance (genetic algorithm)
Integer programming
Interior-point method
Invariant measure
Iterated function
Iterated function system
Iterated local search
Iterative deepening A*
Iterative deepening depth-first search
Iterative method
Job shop scheduling
Johnson's algorithm
Julia set
Jump point search
Karush–Kuhn–Tucker conditions
Killer heuristic
Knapsack problem
Koch snowflake
Kruskal's algorithm
Krylov–Bogolyubov theorem
Lagrange multiplier
Lagrangian relaxation
Learning automaton
Limit cycle
Limit set
Line search
Linear dynamical system
Linear programming
Linear system
Linear time-invariant system
Local consistency
Local optimum
Local search (constraint satisfaction)
Local search (optimization)
Logistic map
Longest path problem
Look-ahead (backtracking)
Lorenz system
Loss function
Loss of significance
Lyapunov exponent
Lyapunov function
Lyapunov optimization
Lyapunov stability
Lyapunov time
Makespan
Mandelbrot set
Markov decision process
Markov partition
Matching (graph theory)
Mathematical optimization
Max-flow min-cut theorem
Maxima and minima
Maximum cut
Maximum flow problem
Measure-preserving dynamical system
Memetic algorithm
Meshfree methods
Meta-optimization
Metaheuristic
Metastability
Minimax
Minimum cut
Minimum spanning tree
Minimum-cost flow problem
Mixing (mathematics)
Monte Carlo integration
Monte Carlo localization
Monte Carlo method
Monte Carlo tree search
Motion planning
Multi-agent system
Multi-armed bandit
Multi-commodity flow problem
Multi-objective optimization
Multiplicative weight update method
Mutation (genetic algorithm)
Natural evolution strategy
Navigation function
Nearest neighbor search
Negamax
Network simplex algorithm
Neuroevolution
Newton's method
NK model
No free lunch in search and optimization
Nonlinear programming
Nonlinear system
Normal form (dynamical systems)
Numerical analysis
Numerical differentiation
Numerical integration
Numerical partial differential equations
Numerical stability
Nyquist stability criterion
Open-shop scheduling
Operations research
Optimal control
Optimal substructure
Optimization problem
Orbit (dynamics)
Ornstein isomorphism theorem
Overlapping subproblems
Packing problems
Parallel metaheuristic
Parametric programming
Partial-order planning
Partially observable Markov decision process
Particle swarm optimization
Pathfinding
Penalty method
Perceptual control theory
Period-doubling bifurcation
Periodic point
Perturbation function
Phase line (mathematics)
Phase plane
Phase portrait
Poincaré map
Poincaré recurrence theorem
Point location
Polygon triangulation
Posynomial
Preference-based planning
Prim's algorithm
Principal variation search
Probabilistic roadmap
Procedural reasoning system
Production system (computer science)
Projected dynamical system
Pullback attractor
Q-learning
Quadratic programming
Quantum annealing
Quantum optimization algorithms
Quasi-Monte Carlo method
Quasi-Newton Least Squares Method
Quasi-Newton method
Quiescence search
Random dynamical system
Random search
Range searching
Rapidly-exploring random tree
Reactive planning
Reasoning system
Recurrence plot
Recurrence relation
Reinforcement learning
Relaxation (approximation)
Rete algorithm
Reward-based selection
Robot navigation
Robotic mapping
Robust optimization
Round-off error
Saddle point
Search algorithm
Second partial derivative test
Second-order cone programming
Selection (genetic algorithm)
Self-organization
Self-organized criticality
Self-replication
Self-similarity
Semidefinite programming
Sequential minimal optimization
Set cover problem
Set packing
Shape optimization
Sharkovskii's theorem
Shift space
Shift-invariant system
Shortest path problem
Signomial
Simplex algorithm
Simulated annealing
Simulation-based optimization
Simultaneous localization and mapping
Spontaneous order
Spreading activation
Stability criterion
Stability theory
Stable manifold
State space
State space planning
State space search
State–action–reward–state–action
Stationary point
Stochastic approximation
Stochastic calculus
Stochastic cellular automaton
Stochastic differential equation
Stochastic diffusion search
Stochastic dynamic programming
Stochastic gradient descent
Stochastic optimization
Stochastic partial differential equation
Stochastic programming
Stochastic universal sampling
Stockfish (chess)
Strong duality
Structural stability
Subgradient method
Subshift of finite type
Subsumption architecture
Sum-of-squares optimization
Swarm intelligence
Symbolic dynamics
System
System dynamics
Systems science
Systems theory
Tabu search
Temporal difference learning
Test functions for optimization
Thompson sampling
Time reversibility
Time-invariant system
Time-variant system
Topological conjugacy
Topology optimization
Tournament selection
Trajectory optimization
Transportation theory (mathematics)
Transposition table
Transshipment problem
Travelling salesman problem
Tree traversal
Triangulation (geometry)
Truncation error
Trust region
Variation (game tree)
Variational inequality
Vector optimization
Vehicle routing problem
Vertex cover
Visibility graph
Von Neumann universal constructor
Voronoi diagram
Wandering set
Weak duality
Winner-take-all in action selection
Wolfe conditions
Zobrist hashing