论文信息 - 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

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.

Jia-Ming Cao | Jia-Ming Cao

[1] Panos M. Pardalos,et al. Open questions in complexity theory for numerical optimization , 1992, Mathematical programming.

[2] O. L. Mangasarian,et al. Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems , 1980, Math. Program..

[3] Panos M. Pardalos,et al. Constrained Global Optimization: Algorithms and Applications , 1987, Lecture Notes in Computer Science.

[4] S. Vavasis. Nonlinear optimization: complexity issues , 1991 .

[5] Jorge J. Moré,et al. On the solution of concave knapsack problems , 1990, Math. Program..

[6] Stephen A. Vavasis,et al. Local minima for indefinite quadratic knapsack problems , 1992, Math. Program..

[7] C. B. Luis. Une caractérisation complète des minima locaux en programmation quadratique , 1980 .

[8] Katta G. Murty,et al. Some NP-complete problems in quadratic and nonlinear programming , 1987, Math. Program..

[9] Panos M. Pardalos,et al. Quadratic programming with one negative eigenvalue is NP-hard , 1991, J. Glob. Optim..

[10] P. Pardalos,et al. Checking local optimality in constrained quadratic programming is NP-hard , 1988 .