Sufficient Global Optimality Conditions for Some Nonconvex Quadratic Program Problems
Explore this paper's citation graph
Summary
Some sufficient global optimality conditions for some nonconvex quadratic program problems with quadratics constrains are presented according to the property of L-subdifferential, which ensures that a feasible point is a global minimzer of a nonconcex quadRatic minimization problem subject to quad ratic constraints.
- Type
- article
- Published
- 2010-01-01
- Cited by
- 0
- References
- 0
- OpenAlex
- https://openalex.org/W2366868484
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:125058944
Keywords
Quadratic equation, Quadratically constrained quadratic program, Quadratic programming, Mathematical optimization, Minification
References
No references recorded for this paper.
Cited by
No citing papers recorded for this paper.
Related papers
- Sufficient global optimality conditions for some nonconvex quadratic program problems
- Sufficient Global Optimality Conditions for Some Nonconvex Quadratic Program Problems with Quadratic Constraints
- Global Optimality Conditions for Quadratic Program Problems with Quadratic Constraints
- Global optimality conditions for nonconvex minimization problems with quadratic constraints
- Global optimality conditions for mixed nonconvex quadratic programs
- New optimality conditions for quadratic optimization problems with binary constraints
- Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
- Global optimality conditions for quadratic 0-1 optimization problems
- Global Optimality Conditions of Non-convex Quadratic Problem with Quadratic Equality Constraints
- Global optimality conditions for quadratic 0–1 programming with inequality constraints