A deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem

DOI10.1016/J.NEUNET.2012.12.002zbMath1357.90106OpenAlexW2020995526WikidataQ45168330 ScholiaQ45168330MaRDI QIDQ901339

Jianqing Liang, Yang Yang, Chuangyin Dang

Publication date: 11 January 2016

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2012.12.002

zbMATH Keywords

iterative algorithmLagrange multiplierlinear constraintsdescent directionHopfield-type barrier functionnonconvex quadratic minimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

An approximation algorithm for graph partitioning via deterministic annealing neural network

This page was built for publication: A deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem