User:Zarzuelazen/Books/Reality Theory: Optimization

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

As wiki lgm parab.svg
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
Approximation algorithm
Artificial intelligence in video games
Artificial life
Assignment problem
Attractor
Augmented Lagrangian method
Automated planning and scheduling
B*
Backjumping
Backmarking
Backtracking
Beam search
Behavior tree (artificial intelligence, robotics and control)
Behavior-based robotics
Belief–desire–intention software model
Bellman equation
Beltrami identity
Bernoulli scheme
Best-first search
Bidirectional search
Bifurcation theory
Bitboard
Board representation (chess)
Branch and bound
Breadth-first search
Brute-force search
Butterfly effect
Calculus of variations
Cantor set
Causal loop diagram
Cellular evolutionary algorithm
Chaos theory
Chess engine
Chess opening book (computers)
Chromosome (genetic algorithm)
Collective intelligence
Combinatorial optimization
Combinatorial search
Complementarity theory
Complex adaptive system
Complex system
Complexity
Computer bridge
Computer chess
Computer Go
Computer poker player
Computer shogi
Conflict resolution strategy
Conic optimization
Constrained optimization
Constraint (mathematics)
Constraint Composite Graph
Constraint graph
Constraint learning
Constraint satisfaction
Constraint satisfaction problem
Convex optimization
Coordinate descent
Critical point (mathematics)
Cross-entropy method
Crossover (genetic algorithm)
Cutting-plane method
Cybernetics
D*
Deep Blue (chess computer)
Deep Blue versus Garry Kasparov
Depth-first search
Derivative-free optimization
Differential evolution
Dijkstra's algorithm
Discrete time and continuous time
Duality (optimization)
Dynamic programming
Dynamical system
Dynamical system (definition)
Dynamical systems theory
Edge of chaos
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
Feasible region
Feedback
Fitness approximation
Fitness function
Fitness landscape
Flow (mathematics)
Fractal
Fractal dimension
Fractional programming
Functional derivative
Fuzzy control system
General game playing
Genetic algorithm
Genetic operator
Genetic programming
Genetic representation
Global optimization
Gradient descent
Graph traversal
Greedy algorithm
Guided Local Search
Gödel machine
Heuristic (computer science)
Hierarchical control system
Hierarchical task network
Hill climbing
Horizon effect
Human-based genetic algorithm
Human–computer chess matches
Hyper-heuristic
Incremental heuristic search
Infinite-dimensional optimization
Integer programming
Interior point method
Iterated function
Iterated function system
Iterated local search
Iterative deepening A*
Iterative deepening depth-first search
Iterative method
Julia set
Jump point search
Karush–Kuhn–Tucker conditions
Killer heuristic
Knapsack problem
Koch snowflake
Lagrange multiplier
Learning automaton
Limit cycle
Limit set
Line search
Linear dynamical system
Linear programming
Linear system
Local consistency
Local optimum
Local search (constraint satisfaction)
Local search (optimization)
Logistic map
Look-ahead (backtracking)
Lorenz system
Loss function
Lyapunov exponent
Lyapunov function
Lyapunov optimization
Lyapunov stability
Lyapunov time
Mandelbrot set
Markov decision process
Markov partition
Mathematical optimization
Max-flow min-cut theorem
Maxima and minima
Measure-preserving dynamical system
Memetic algorithm
Meta-optimization
Metaheuristic
Metastability
Minimax
Mixing (mathematics)
Monte Carlo integration
Monte Carlo localization
Monte Carlo method
Monte Carlo tree search
Motion planning
Multi-agent system
Multi-armed bandit
Multi-objective optimization
Mutation (genetic algorithm)
Natural evolution strategy
Navigation function
Negamax
Neuroevolution
Newton's method
NK model
No free lunch in search and optimization
Nonlinear programming
Nonlinear system
Normal form (dynamical systems)
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
Perceptual control theory
Periodic point
Poincaré map
Poincaré recurrence theorem
Preference-based planning
Principal variation search
Probabilistic roadmap
Procedural reasoning system
Production system (computer science)
Q-learning
Quadratic programming
Quantum annealing
Quasi-Monte Carlo method
Quasi-Newton Least Squares Method
Quasi-Newton method
Quiescence search
Rapidly-exploring random tree
Reactive planning
Reasoning system
Recurrence plot
Reinforcement learning
Relaxation (approximation)
Rete algorithm
Robot navigation
Robotic mapping
Robust optimization
Saddle point
Search algorithm
Second-order cone programming
Selection (genetic algorithm)
Self-organization
Self-organized criticality
Self-replication
Self-similarity
Semidefinite programming
Sequential minimal optimization
Shift space
Simplex algorithm
Simulated annealing
Simulation-based optimization
Simultaneous localization and mapping
Spontaneous order
Spreading activation
Stability theory
Stable manifold
State space
State space planning
State space search
State–action–reward–state–action
Stationary point
Stochastic approximation
Stochastic diffusion search
Stochastic dynamic programming
Stochastic gradient descent
Stochastic optimization
Stochastic programming
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
Trajectory optimization
Transportation theory (mathematics)
Transposition table
Transshipment problem
Travelling salesman problem
Tree traversal
Trust region
Variation (game tree)
Variational inequality
Visibility graph
Von Neumann universal constructor
Wandering set
Weak duality
Winner-take-all in action selection
Zobrist hashing