A review on deterministic annealing algorithms based on entropy constraints

DOI10.12084/J.ISSN.2096-3289.2021.02.001MaRDI QIDQ5017231zbMATH OpenFDO

Authors Zhengtian Wu, Jinyu Dai

Publication date 17 December 2021

zbMATH Keywords

global optimizationdeterministic annealinghomotopy methodfree energy function

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Constraint selection and deterministic annealing
• scientific article; zbMATH DE number 1054758
• scientific article; zbMATH DE number 1688606
• A deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem
• Deterministic annealing approach to fuzzy \(c\)-means clustering based on entropy maximization

Cited in

(3)

• Deterministic Annealing for Entropy-Constrained Vector Quantizer Design
• Deterministic annealing process for pLSA-induced fuzzy co-clustering and cluster splitting characteristics
• Constraint selection and deterministic annealing

This page was built for publication: A review on deterministic annealing algorithms based on entropy constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5017231)