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

DOI10.1016/J.NEUNET.2012.12.002zbMATH Open1357.90106OpenAlexW2020995526WikidataQ45168330 ScholiaQ45168330MaRDI QIDQ901339FDOQ901339

Authors: Chuangyin Dang, Jianqing Liang, Yang Yang 

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

Recommendations

• A deterministic annealing algorithm for approximating a solution of the min-bisection problem
• A barrier function method for the nonconvex quadratic programming problem with box constraints
• Constraint selection and deterministic annealing
• A deterministic annealing algorithm for the minimum concave cost network flow problem
• scientific article; zbMATH DE number 3922383

zbMATH Keywords

iterative algorithmLagrange multiplierdescent directionlinear constraintsHopfield-type barrier functionnonconvex quadratic minimization

Mathematics Subject Classification ID

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

Cited In (5)

• Constraint selection and deterministic annealing
• A deterministic annealing algorithm for approximating a solution of the min-bisection problem
• A barrier function method for the nonconvex quadratic programming problem with box constraints
• A review on deterministic annealing algorithms based on entropy constraints
• 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

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