Using copositivity for global optimality criteria in concave quadratic programming problems
For the general linearly constrained concave quadratic minimization problem, the authors give necessary and sufficient optimality conditions which are expressed in terms of the copositivity, with respect to a certain cone, of an associated matrix. The proof is based on results of \textit{J.-B. Hiriart-Urruty} [in: `Nonsmooth optimization and related topics', Proc. 4th Course Int. Sch. Math., Erice/Italy 1988, Ettore Majorana Int. Sci. Ser., Phys. Sci. 43, 219-239 (1989; Zbl 0735.90056)] characterizing global minima of differences of convex functions.
- Publication:4942383
- Role of copositivity in optimality criteria for nonconvex optimization problems
- scientific article; zbMATH DE number 4147869
- Copositivity and the Minimization of Quadratic Functions with Nonnegativity and Quadratic Equality Constraints
- scientific article; zbMATH DE number 3970535
- scientific article; zbMATH DE number 4174235 (Why is no real title available?)
- scientific article; zbMATH DE number 3176168 (Why is no real title available?)
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- scientific article; zbMATH DE number 16313 (Why is no real title available?)
- scientific article; zbMATH DE number 3513549 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3350062 (Why is no real title available?)
- Necessary and sufficient conditions for quadratic minimality
- On copositive matrices
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- Remarks on the recursive structure of copositivity
- Some NP-complete problems in quadratic and nonlinear programming
- Une caractérisation complete des minima locaux en programmation quadratique
- Using copositivity for global optimality criteria in concave quadratic programming problems
- An optimality criterion for global quadratic optimization
- Using copositivity for global optimality criteria in concave quadratic programming problems
- Role of copositivity in optimality criteria for nonconvex optimization problems
- Necessary and sufficient global optimality conditions for convex maximization revisited
- A test for copositive matrices
- Optimality conditions and optimization methods for quartic polynomial optimization
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- Block pivoting and shortcut strategies for detecting copositivity
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems
- Copositivity aspects of standard quadratic optimization problems
- Copositivity for second-order optimality conditions in general smooth optimization problems
- scientific article; zbMATH DE number 4147869 (Why is no real title available?)
- Copositive optimization -- recent developments and applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Copositivity and the Minimization of Quadratic Functions with Nonnegativity and Quadratic Equality Constraints
- scientific article; zbMATH DE number 1419369 (Why is no real title available?)
- On copositive programming and standard quadratic optimization problems
- A copositivity probe
- scientific article; zbMATH DE number 7743708 (Why is no real title available?)
- Global optimality conditions for some classes of optimization problems
This page was built for publication: Using copositivity for global optimality criteria in concave quadratic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1319026)
