Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs

Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs

0.00 Avg rating0 Votes
Article ID: iaor19971134
Country: Netherlands
Volume: 69
Issue: 3
Start Page Number: 403
End Page Number: 411
Publication Date: Sep 1995
Journal: Mathematical Programming (Series A)
Authors:
Abstract:

The author earlier studies the equivalence of a class of 0-1 quadratic programs and their relaxed problems. Thus, a class of combinatorial optimization problems can be solved by solving a class of nonconvex quadratic programs. In this paper, a necessary and sufficient conditon for local minima of this class of nonconvex quadratic programs is given; this will be the foundation for study of algorithms.

Reviews

Required fields are marked *. Your email address will not be published.