Sufficient global optimality conditions for some nonconvex quadratic program problems
Jia Zhang, Zhiyuan Tian
Abstract
Jia Zhang, Zhiyuan Tian
Abstract
In this paper, a class of quadratic program problem with quadratic constrains is studied. Some sufficient global optimality conditions for some nonconvex quadratic program problems with quadratic constrains are presented according to the property of L- subdifferential. We also prove that, in the special cases, some sufficient global optimality conditions can be obtained at the same time.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, a class of quadratic program problem with quadratic constrains is studied. Some sufficient global optimality conditions for some nonconvex quadratic program problems with quadratic constrains are presented according to the property of L- subdifferential. We also prove that, in the special cases, some sufficient global optimality conditions can be obtained at the same time.
Key concepts: Quadratic equation, Quadratic programming, Mathematical optimization, Property (philosophy), Quadratically constrained quadratic program, Class (philosophy), Quadratic model, Mathematics