User:Amatdiou/Books/terative methods

terative methods

 * Category:Iterative methods
 * Discretization
 * Fixed-point iteration
 * Frank–Wolfe algorithm
 * Iterative method
 * Local convergence
 * Relaxation (iterative method)


 * Category:Optimization algorithms and methods
 * Search-based software engineering
 * Active set
 * Adaptive coordinate descent
 * Alpha–beta pruning
 * Artificial bee colony algorithm
 * Auction algorithm
 * Augmented Lagrangian method
 * Automatic label placement
 * Bees algorithm
 * Benson's algorithm
 * BHHH algorithm
 * Big M method
 * Bin packing problem
 * Biogeography-based optimization
 * Biologically inspired algorithms
 * Bland's rule
 * Branch and bound
 * Branch and cut
 * Branch and price
 * Broyden–Fletcher–Goldfarb–Shanno algorithm
 * CMA-ES
 * COBYLA
 * Coffman–Graham algorithm
 * Column generation
 * Crew scheduling
 * Criss-cross algorithm
 * Cross-entropy method
 * Cuckoo search
 * Cutting-plane method
 * Davidon–Fletcher–Powell formula
 * Derivation of the conjugate gradient method
 * Destination dispatch
 * Differential evolution
 * Divide and conquer algorithm
 * Dykstra's projection algorithm
 * Dynamic programming
 * Eagle strategy
 * Evolutionary algorithm
 * Evolutionary programming
 * Expectation–maximization algorithm
 * Extremal optimization
 * Fernandez’s method
 * Firefly algorithm
 * Fourier–Motzkin elimination
 * Gauss–Newton algorithm
 * Gene expression programming
 * Genetic algorithm
 * Genetic algorithms in economics
 * Glowworm swarm optimization
 * Golden section search
 * Gradient descent
 * Gradient method
 * Graduated optimization
 * Great Deluge algorithm
 * Greedy algorithm
 * Guided Local Search
 * Harmony search
 * Hill climbing
 * Imperialist competitive algorithm
 * Intelligent Water Drops algorithm
 * Interior point method
 * Interval contractor
 * IOSO
 * IPOPT
 * Iterated local search
 * Job shop scheduling
 * Kantorovich theorem
 * Karmarkar's algorithm
 * Killer heuristic
 * Lemke's algorithm
 * Levenberg–Marquardt algorithm
 * Limited-memory BFGS
 * Line search
 * Local search (optimization)
 * Luus–Jaakola
 * Matrix chain multiplication
 * Maximum subarray problem
 * MCS algorithm
 * Mehrotra predictor–corrector method
 * Meta-optimization
 * Minimax
 * MM algorithm
 * Multi-swarm optimization
 * Natural evolution strategy
 * Negamax
 * Nelder–Mead method
 * Newton's method
 * Newton's method in optimization
 * Nonlinear conjugate gradient method
 * Nonlinear programming
 * Ordered subset expectation maximization
 * Parallel metaheuristic
 * Particle swarm optimization
 * Pattern search (optimization)
 * Penalty method
 * Powell's method
 * Quantum annealing
 * Quasi-Newton method
 * Random optimization
 * Random search
 * Reactive search optimization
 * Rosenbrock methods
 * Sequence-dependent setup
 * Sequential minimal optimization
 * Sequential quadratic programming
 * Simplex algorithm
 * Simulated annealing
 * Simultaneous perturbation stochastic approximation
 * Space allocation problem
 * Space mapping
 * Special ordered set
 * Stochastic hill climbing
 * Successive parabolic interpolation
 * Swarm intelligence
 * Symmetric rank-one
 * Tabu search
 * Tree rearrangement
 * Trust region
 * Very large-scale neighborhood search
 * Zionts–Wallenius method


 * Category:Combinatorial optimization
 * Combinatorial optimization
 * Submodular set function
 * 1-center problem
 * A* search algorithm
 * Assignment problem
 * B*
 * Bottleneck traveling salesman problem
 * Bridge and torch problem
 * Change-making problem
 * Combinatorial search
 * Continuous knapsack problem
 * Cut (graph theory)
 * Cutting stock problem
 * Dijkstra's algorithm
 * EasyLocal++
 * Edge cycle cover
 * Jack Edmonds
 * Ellipsoid method
 * Extremal combinatorics
 * Floorplan (microelectronics)
 * Gomory–Hu tree
 * Graph bandwidth
 * Greedoid
 * Greedy randomized adaptive search procedure
 * Hungarian algorithm
 * Integer programming
 * Kernighan–Lin algorithm
 * Knapsack problem
 * Lin–Kernighan heuristic
 * Linear bottleneck assignment problem
 * Linear programming relaxation
 * List of knapsack problems
 * Matching (graph theory)
 * Matroid intersection
 * Max-flow min-cut theorem
 * Maximum cut
 * Maximum satisfiability problem
 * Metric k-center
 * Minimum cut
 * Minimum k-cut
 * Quadratic assignment problem
 * Quadratic bottleneck assignment problem
 * Set TSP problem
 * Smallest-circle problem
 * Subadditive set function
 * Traveling tourist problem
 * Weapon target assignment problem
 * Weight function


 * Category:Linear programming
 * Linear programming
 * Basic solution (linear programming)
 * Dual cone and polar cone
 * Duality (optimization)
 * Duality gap
 * Farkas' lemma
 * Graver basis
 * Hilbert basis (linear programming)
 * Integer points in convex polyhedra
 * Klee–Minty cube
 * Linear inequality
 * LP-type problem
 * Perturbation function
 * Prune and search
 * Semidefinite programming
 * Strong duality
 * Vertex enumeration problem
 * Weak duality


 * Category:Network flow
 * Audit Record Generation and Utilization System
 * Braess's paradox
 * Circulation problem
 * Dinic's algorithm
 * Edmonds–Karp algorithm
 * Flow network
 * Ford–Fulkerson algorithm
 * Fuzzy transportation
 * Maximum flow problem
 * Minimum-cost flow problem
 * Multi-commodity flow problem
 * Nowhere-zero flow
 * Push–relabel maximum flow algorithm


 * Category:Dynamic programming
 * Approximate string matching
 * Automatic basis function construction
 * Backward induction
 * Bellman equation
 * Bellman–Ford algorithm
 * Bitonic tour
 * Curse of dimensionality
 * Damerau–Levenshtein distance
 * Differential dynamic programming
 * Dynamic time warping
 * Earley parser
 * Floyd–Warshall algorithm
 * Forward–backward algorithm
 * Hamilton–Jacobi–Bellman equation
 * Hirschberg's algorithm
 * Hunt–McIlroy algorithm
 * Levenshtein distance
 * Longest alternating subsequence
 * Longest common subsequence problem
 * Longest common substring problem
 * Longest increasing subsequence
 * Markov decision process
 * Needleman–Wunsch algorithm
 * Optimal stopping
 * Optimal substructure
 * Overlapping subproblems
 * Partially observable Markov decision process
 * Recursive economics
 * Shortest common supersequence
 * Smith–Waterman algorithm
 * Talk:Subset sum problem
 * Subset sum problem
 * Viscosity solution
 * Viterbi algorithm
 * Word wrap


 * Category:Stochastic optimization
 * Stochastic optimization
 * Ant colony optimization algorithms
 * Bayesian optimization
 * BRST algorithm
 * Multi-armed bandit
 * Optimal computing budget allocation
 * Parallel tempering
 * Scenario optimization
 * Simulation Optimization Library: Throughput Maximization
 * Stochastic approximation
 * Stochastic gradient descent
 * Stochastic programming
 * Stochastic tunneling