Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Global optimization
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Heuristics and metaheuristics == {{main|Metaheuristic}} Other approaches include heuristic strategies to search the search space in a more or less intelligent way, including: * [[Ant colony optimization algorithms|Ant colony optimization]] (ACO) * [[Simulated annealing]], a generic probabilistic metaheuristic * [[Tabu search]], an extension of [[Local search (optimization)|local search]] capable of escaping from local minima * [[Evolutionary algorithm]]s (e.g., [[genetic algorithms]] and [[evolution strategies]]) * [[Differential evolution]], a method that [[optimization (mathematics)|optimizes]] a problem by [[iterative method|iteratively]] trying to improve a [[candidate solution]] with regard to a given measure of quality * [[Swarm intelligence|Swarm-based optimization algorithms]] (e.g., [[particle swarm optimization]], [[social cognitive optimization]], [[multi-swarm optimization]] and [[ant colony optimization]]) * [[Memetic algorithm]]s, combining global and local search strategies * Reactive search optimization (i.e. integration of sub-symbolic machine learning techniques into search heuristics) * [[Graduated optimization]], a technique that attempts to solve a difficult optimization problem by initially solving a greatly simplified problem, and progressively transforming that problem (while optimizing) until it is equivalent to the difficult optimization problem.<ref>{{cite book |first1=Neil |last1=Thacker |first2=Tim |last2=Cootes |chapter-url=http://homepages.inf.ed.ac.uk/rbf/CVonline/LOCAL_COPIES/BMVA96Tut/node29.html |chapter=Graduated Non-Convexity and Multi-Resolution Optimization Methods |title=Vision Through Optimization |year=1996}}</ref><ref>{{cite book |first1=Andrew |last1=Blake |first2=Andrew |last2=Zisserman |url=http://research.microsoft.com/en-us/um/people/ablake/papers/VisualReconstruction/ |title=Visual Reconstruction |publisher=MIT Press |year=1987 |isbn=0-262-02271-0}}{{page needed|date=October 2011}}</ref><ref name="mobahi2015">Hossein Mobahi, John W. Fisher III. [http://people.csail.mit.edu/hmobahi/pubs/gaussian_convenv_2015.pdf On the Link Between Gaussian Homotopy Continuation and Convex Envelopes], In Lecture Notes in Computer Science (EMMCVPR 2015), Springer, 2015.</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)