Sufficient Global Optimality Conditions for Some Nonconvex Quadratic Program Problems
Jingyu Li
Abstract
Jingyu Li
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,which ensures that a feasible point is a global minimzer of a nonconvex quadratic minimization problem subject to quadratic constraints.
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,which ensures that a feasible point is a global minimzer of a nonconvex quadratic minimization problem subject to quadratic constraints.
Key concepts: Quadratic equation, Quadratically constrained quadratic program, Quadratic programming, Mathematical optimization, Minification, Property (philosophy), Mathematics, Quadratic model