Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs |
| |
| Authors: | Jia-Ming Cao |
| |
| Institution: | (1) Department of Transportation Engineering, Southwest Jiaotong University, 610031 Chengdu, Sichuan, China;(2) Present address: Institute of Transportation Studies, University of California, 108 Naval Architecture Building, 94720 Berkeley, CA, United States |
| |
| Abstract: | The author (1992, 1993) earlier studied 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 condition for local minima of this class of nonconvex quadratic programs is given; this will be the foundation for study of algorithms.Research supported by Huo Yingdong Educational Foundation '93. |
| |
| Keywords: | Nonconvex quadratic programming Local minimum NP-complete Necessary and sufficient condition |
| 本文献已被 SpringerLink 等数据库收录！ |
|
