About: Difference-map algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Difference-map algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : yago:Rule105846932, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FDifference-map_algorithm&invfp=IFP_OFF&sas=SAME_AS_OFF

The difference-map algorithm is a search algorithm for general constraint satisfaction problems. It is a meta-algorithm in the sense that it is built from more basic algorithms that perform projections onto constraint sets. From a mathematical perspective, the difference-map algorithm is a dynamical system based on a mapping of Euclidean space. Solutions are encoded as fixed points of the mapping.

Attributes	Values
rdf:type	software yago:WikicatSearchAlgorithms yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Algorithm105847438 yago:Event100029378 yago:Procedure101023820 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity yago:Rule105846932
rdfs:label	Difference-map algorithm (en)
rdfs:comment	The difference-map algorithm is a search algorithm for general constraint satisfaction problems. It is a meta-algorithm in the sense that it is built from more basic algorithms that perform projections onto constraint sets. From a mathematical perspective, the difference-map algorithm is a dynamical system based on a mapping of Euclidean space. Solutions are encoded as fixed points of the mapping. (en)
foaf:depiction	$http://commons.wikimedia.org/wiki/Special:FilePath/Diffraction_data.png$
dcterms:subject	Search algorithms Constraint programming
Wikipage page ID	10145406 (xsd:integer)
Wikipage revision ID	1086379622 (xsd:integer)
Link from a Wikipage to another Wikipage	Hybrid input output (HIO) algorithm for phase retrieval Dynamical system Protein structure prediction Iterative methods Search algorithms Convex optimization NP-complete Constraint (mathematics) Constraint satisfaction Strange attractor Fraunhofer diffraction $http://dbpedia.org/resource/File:Diffraction_data.png$ Phase problem Local search (optimization) Absolute value Euclidean space Fixed point (mathematics) Projection (linear algebra) Constraint programming Chaos theory Support (mathematics) Unitary transformation Diophantine equations Discrete Fourier transform 3-SAT Boolean satisfiability problem Meta-algorithm Search algorithm Map (mathematics) Literal (mathematical logic) Sudoku Set intersection 2-SAT Ramsey numbers Coherent light dbr:Douglas-Rachford_algorithm dbr:Incomplete_algorithm
Link from a Wikipage to an external page	https://barisdemiroz.github.io/sudoku/sudokusolver_demo.html
sameAs	Difference-map algorithm Difference-map algorithm Difference-map algorithm Difference-map algorithm
dbp:wikiPageUsesTemplate	dbt:Reflist
thumbnail	wiki-commons:Special:FilePath/Iterations_0,_100,_200,_300_and_400_in_difference-map_reconstruction_of_grayscale_image_from_Fourier_transform_modulus.png?width=300
has abstract	The difference-map algorithm is a search algorithm for general constraint satisfaction problems. It is a meta-algorithm in the sense that it is built from more basic algorithms that perform projections onto constraint sets. From a mathematical perspective, the difference-map algorithm is a dynamical system based on a mapping of Euclidean space. Solutions are encoded as fixed points of the mapping. Although originally conceived as a general method for solving the phase problem, the difference-map algorithm has been used for the boolean satisfiability problem, protein structure prediction, Ramsey numbers, diophantine equations, and Sudoku, as well as sphere- and disk-packing problems. Since these applications include NP-complete problems, the scope of the difference map is that of an . Whereas incomplete algorithms can efficiently verify solutions (once a candidate is found), they cannot prove that a solution does not exist. The difference-map algorithm is a generalization of two iterative methods: Fienup's Hybrid input output (HIO) algorithm for phase retrieval and the for convex optimization. Iterative methods, in general, have a long history in phase retrieval and convex optimization. The use of this style of algorithm for hard, non-convex problems is a more recent development. (en)
gold:hypernym	Algorithm
prov:wasDerivedFrom	wikipedia-en:Difference-map_algorithm?oldid=1086379622&ns=0
page length (characters) of wiki page	13580 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Difference-map_algorithm
is Link from a Wikipage to another Wikipage of	List of algorithms Ptychography Elser Difference-Map Algorithm Difference map algorithm
is Wikipage redirect of	Elser Difference-Map Algorithm Difference map algorithm
is foaf:primaryTopic of	wikipedia-en:Difference-map_algorithm

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software