Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Optimization algorithms and methods
An Entity of Type:
Concept
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Property
Value
dbo:
wikiPageID
34044100
(xsd:integer)
dbo:
wikiPageRevisionID
952533981
(xsd:integer)
dbp:
wikiPageUsesTemplate
dbt
:Commons
dbt
:CatAutoTOC
dbt
:Cat_main
rdf:
type
skos
:Concept
rdfs:
label
Optimization algorithms and methods
(en)
owl:
sameAs
dbpedia-commons
:Optimization algorithms and methods
skos:
broader
dbc
:Iterative_methods
dbc
:Algorithms
dbc
:Mathematical_optimization
skos:
prefLabel
Optimization algorithms and methods
(en)
prov:
wasDerivedFrom
wikipedia-en
:Category:Optimization_algorithms_and_methods?oldid=952533981&ns=14
is
dbo:
wikiPageWikiLink
of
dbr
:Envy_minimization
dbr
:List_of_algorithms
dbr
:Mehrotra_predictor–corrector_method
dbr
:Branch_and_bound
dbr
:Bregman_Lagrangian
dbr
:Bregman_method
dbr
:Pattern_search_(optimization)
dbr
:Cunningham's_rule
dbr
:Cutting-plane_method
dbr
:DATADVANCE
dbr
:Davidon–Fletcher–Powell_formula
dbr
:Derivation_of_the_conjugate_gradient_method
dbr
:Derivative-free_optimization
dbr
:Destination_dispatch
dbr
:Dykstra's_projection_algorithm
dbr
:Interior-point_method
dbr
:Interval_contractor
dbr
:Levenberg–Marquardt_algorithm
dbr
:Limited-memory_BFGS
dbr
:Penalty_method
dbr
:Powell's_dog_leg_method
dbr
:Robust_fuzzy_programming
dbr
:Criss-cross_algorithm
dbr
:Mathematical_optimization
dbr
:Maximum_subarray_problem
dbr
:Gauss–Newton_algorithm
dbr
:Generalized_iterative_scaling
dbr
:Genetic_algorithms_in_economics
dbr
:Genetic_improvement_(computer_science)
dbr
:Nelder–Mead_method
dbr
:Semidefinite_embedding
dbr
:Quasi-Newton_method
dbr
:Social_cognitive_optimization
dbr
:Gradient_descent
dbr
:Branch_and_cut
dbr
:Branch_and_price
dbr
:Constructive_heuristic
dbr
:Crew_scheduling
dbr
:Critical_line_method
dbr
:Cross-entropy_method
dbr
:Ordered_subset_expectation_maximization
dbr
:Ant_colony_optimization_algorithms
dbr
:Basin-hopping
dbr
:Benson's_algorithm
dbr
:Berndt–Hall–Hall–Hausman_algorithm
dbr
:Level-set_method
dbr
:Simulated_annealing
dbr
:Column_generation
dbr
:Communication-avoiding_algorithm
dbr
:Frank–Wolfe_algorithm
dbr
:Quantum_annealing
dbr
:Matheuristics
dbr
:Matrix_chain_multiplication
dbr
:Active-set_method
dbr
:Adaptive_coordinate_descent
dbr
:Adaptive_dimensional_search
dbr
:Adaptive_simulated_annealing
dbr
:Divide-and-conquer_algorithm
dbr
:Karmarkar's_algorithm
dbr
:Learning_rate
dbr
:Least-squares_spectral_analysis
dbr
:Least_squares
dbr
:Line_search
dbr
:Linear-fractional_programming
dbr
:Lloyd's_algorithm
dbr
:Local_convergence
dbr
:Local_search_(optimization)
dbr
:Network_simplex_algorithm
dbr
:Mirror_descent
dbr
:Affine_scaling
dbr
:Dynamic_programming
dbr
:Alpha–beta_pruning
dbr
:Fernandez's_method
dbr
:PSeven
dbr
:Parallel_metaheuristic
dbr
:Fly_algorithm
dbr
:Fourier–Motzkin_elimination
dbr
:Fractional_programming
dbr
:Golden-section_search
dbr
:Gradient_method
dbr
:Graduated_optimization
dbr
:Iterated_conditional_modes
dbr
:Iterated_local_search
dbr
:Kantorovich_theorem
dbr
:Killer_heuristic
dbr
:Lemke's_algorithm
dbr
:Second-order_cone_programming
dbr
:Nonlinear_conjugate_gradient_method
dbr
:Powell's_method
dbr
:Quadratic_programming
dbr
:Auction_algorithm
dbr
:Backtracking_line_search
dbr
:Bacterial_colony_optimization
dbr
:Hyper-heuristic
dbr
:Successive_parabolic_interpolation
dbr
:Bin_covering_problem
dbr
:Bin_packing_problem
dbr
:Bland's_rule
dbr
:HiGHS_optimization_solver
dbr
:Ternary_search
dbr
:Odds_algorithm
dbr
:Augmented_Lagrangian_method
dbr
:Automatic_label_placement
dbr
:CMA-ES
dbr
:Space_mapping
dbr
:Great_deluge_algorithm
dbr
:Greedy_algorithm
dbr
:Greedy_triangulation
dbr
:Guided_local_search
dbr
:Guillotine_cutting
dbr
:Guillotine_partition
dbr
:Zadeh's_rule
dbr
:IPOPT
dbr
:Broyden–Fletcher–Goldfarb–Shanno_algorithm
dbr
:Newton's_method
dbr
:Newton's_method_in_optimization
dbr
:OR-Tools
dbr
:MCS_algorithm
dbr
:MM_algorithm
dbr
:Minimax
dbr
:Search-based_software_engineering
dbr
:Sequential_minimal_optimization
dbr
:Sequential_quadratic_programming
dbr
:Simultaneous_perturbation_stochastic_approximation
dbr
:Space_allocation_problem
dbr
:Special_ordered_set
dbr
:Successive_linear_programming
dbr
:Simplex_algorithm
dbr
:Zionts–Wallenius_method
dbr
:Negamax
dbr
:Trust_region
dbr
:Expectation–maximization_algorithm
dbr
:Extremal_optimization
dbr
:IOSO
dbr
:In-crowd_algorithm
dbr
:Luus–Jaakola
dbr
:Subgradient_method
dbr
:Symmetric_rank-one
dbr
:Rosenbrock_methods
dbr
:Ruzzo–Tompa_algorithm
dbr
:Evolutionary_algorithm
dbr
:Evolutionary_programming
dbr
:Exact_algorithm
dbr
:Fireworks_algorithm
dbr
:Natural_evolution_strategy
dbr
:Stochastic_hill_climbing
dbr
:Nonlinear_programming
dbr
:Multiple_subset_sum
dbr
:Sequential_linear-quadratic_programming
dbr
:Stochastic_programming
dbr
:Tree_rearrangement
dbr
:Parametric_programming
dbr
:Very_large-scale_neighborhood_search
dbr
:Random_optimization
dbr
:Random_search
dbr
:Stochastic_dynamic_programming
dbr
:Stochastic_gradient_Langevin_dynamics
dbr
:Truncated_Newton_method
dbr
:Spiral_optimization_algorithm
is
dcterms:
subject
of
dbr
:Envy_minimization
dbr
:List_of_algorithms
dbr
:Mehrotra_predictor–corrector_method
dbr
:Branch_and_bound
dbr
:Bregman_Lagrangian
dbr
:Bregman_method
dbr
:Pattern_search_(optimization)
dbr
:Cunningham's_rule
dbr
:Cutting-plane_method
dbr
:DATADVANCE
dbr
:Davidon–Fletcher–Powell_formula
dbr
:Derivation_of_the_conjugate_gradient_method
dbr
:Derivative-free_optimization
dbr
:Destination_dispatch
dbr
:Dykstra's_projection_algorithm
dbr
:Interior-point_method
dbr
:Interval_contractor
dbr
:Levenberg–Marquardt_algorithm
dbr
:Limited-memory_BFGS
dbr
:Penalty_method
dbr
:Powell's_dog_leg_method
dbr
:Robust_fuzzy_programming
dbr
:Criss-cross_algorithm
dbr
:Maximum_subarray_problem
dbr
:Gauss–Newton_algorithm
dbr
:Generalized_iterative_scaling
dbr
:Genetic_algorithms_in_economics
dbr
:Genetic_improvement_(computer_science)
dbr
:Nelder–Mead_method
dbr
:Semidefinite_embedding
dbr
:Quasi-Newton_method
dbr
:Social_cognitive_optimization
dbr
:Gradient_descent
dbr
:Branch_and_cut
dbr
:Branch_and_price
dbr
:Constructive_heuristic
dbr
:Crew_scheduling
dbr
:Critical_line_method
dbr
:Cross-entropy_method
dbr
:Ordered_subset_expectation_maximization
dbr
:Ant_colony_optimization_algorithms
dbr
:Basin-hopping
dbr
:Benson's_algorithm
dbr
:Berndt–Hall–Hall–Hausman_algorithm
dbr
:Level-set_method
dbr
:Simulated_annealing
dbr
:Column_generation
dbr
:Communication-avoiding_algorithm
dbr
:Frank–Wolfe_algorithm
dbr
:Quantum_annealing
dbr
:Matheuristics
dbr
:Matrix_chain_multiplication
dbr
:Active-set_method
dbr
:Adaptive_coordinate_descent
dbr
:Adaptive_dimensional_search
dbr
:Adaptive_simulated_annealing
dbr
:Divide-and-conquer_algorithm
dbr
:Karmarkar's_algorithm
dbr
:Learning_rate
dbr
:Least-squares_spectral_analysis
dbr
:Least_squares
dbr
:Line_search
dbr
:Linear-fractional_programming
dbr
:Lloyd's_algorithm
dbr
:Local_convergence
dbr
:Local_search_(optimization)
dbr
:Network_simplex_algorithm
dbr
:Mirror_descent
dbr
:Affine_scaling
dbr
:Dynamic_programming
dbr
:Alpha–beta_pruning
dbr
:Fernandez's_method
dbr
:PSeven
dbr
:Parallel_metaheuristic
dbr
:Fly_algorithm
dbr
:Fourier–Motzkin_elimination
dbr
:Fractional_programming
dbr
:Golden-section_search
dbr
:Gradient_method
dbr
:Graduated_optimization
dbr
:Iterated_conditional_modes
dbr
:Iterated_local_search
dbr
:Kantorovich_theorem
dbr
:Killer_heuristic
dbr
:Lemke's_algorithm
dbr
:Second-order_cone_programming
dbr
:Nonlinear_conjugate_gradient_method
dbr
:Powell's_method
dbr
:Quadratic_programming
dbr
:Auction_algorithm
dbr
:Backtracking_line_search
dbr
:Bacterial_colony_optimization
dbr
:Hyper-heuristic
dbr
:Successive_parabolic_interpolation
dbr
:Bin_covering_problem
dbr
:Bin_packing_problem
dbr
:Bland's_rule
dbr
:HiGHS_optimization_solver
dbr
:Ternary_search
dbr
:Odds_algorithm
dbr
:Augmented_Lagrangian_method
dbr
:Automatic_label_placement
dbr
:CMA-ES
dbr
:Space_mapping
dbr
:Great_deluge_algorithm
dbr
:Greedy_algorithm
dbr
:Greedy_triangulation
dbr
:Guided_local_search
dbr
:Guillotine_cutting
dbr
:Guillotine_partition
dbr
:Zadeh's_rule
dbr
:IPOPT
dbr
:Broyden–Fletcher–Goldfarb–Shanno_algorithm
dbr
:Newton's_method
dbr
:Newton's_method_in_optimization
dbr
:OR-Tools
dbr
:MCS_algorithm
dbr
:MM_algorithm
dbr
:Minimax
dbr
:Search-based_software_engineering
dbr
:Sequential_minimal_optimization
dbr
:Sequential_quadratic_programming
dbr
:Simultaneous_perturbation_stochastic_approximation
dbr
:Space_allocation_problem
dbr
:Special_ordered_set
dbr
:Successive_linear_programming
dbr
:Simplex_algorithm
dbr
:Zionts–Wallenius_method
dbr
:Negamax
dbr
:Trust_region
dbr
:Expectation–maximization_algorithm
dbr
:Extremal_optimization
dbr
:IOSO
dbr
:In-crowd_algorithm
dbr
:Luus–Jaakola
dbr
:Subgradient_method
dbr
:Symmetric_rank-one
dbr
:Rosenbrock_methods
dbr
:Ruzzo–Tompa_algorithm
dbr
:Evolutionary_algorithm
dbr
:Evolutionary_programming
dbr
:Exact_algorithm
dbr
:Fireworks_algorithm
dbr
:Natural_evolution_strategy
dbr
:Stochastic_hill_climbing
dbr
:Nonlinear_programming
dbr
:Multiple_subset_sum
dbr
:Sequential_linear-quadratic_programming
dbr
:Stochastic_programming
dbr
:Tree_rearrangement
dbr
:Parametric_programming
dbr
:Very_large-scale_neighborhood_search
dbr
:Random_optimization
dbr
:Random_search
dbr
:Stochastic_dynamic_programming
dbr
:Stochastic_gradient_Langevin_dynamics
dbr
:Truncated_Newton_method
dbr
:Spiral_optimization_algorithm
is
skos:
broader
of
dbc
:Decomposition_methods
dbc
:Dynamic_programming
dbc
:Metaheuristics
dbc
:Optimal_scheduling
dbc
:Exchange_algorithms
dbc
:Linear_programming
dbc
:Gradient_methods
dbc
:Least_squares
dbc
:Evolutionary_algorithms
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 3.0 Unported License