Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Mathematical Programming Computation

Globally solving nonconvex quadratic programming problems via completely positive programming

Jieqiu Chen, Samuel Burer

Published Nov 16, 2011• 108 citations
Publisher
DOI
10.1007/s12532-011-0033-9

Related papers

Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods

Pierre Bonami, Oktay Günlük, Jeff Linderoth

Mathematical Programming Computation•Feb 24, 2018•38 citations

Bilinear programming methods for nonconvex quadratic problems

Springer eBooks•Oct 5, 2005•1 citation

A Polyhedral Approach for Nonconvex Quadratic Programming Problems with Box Constraints

Yasutoshi Yajima, Tetsuya Fujie

Journal of Global Optimization•Sep 1, 1998•47 citations

On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study

Ricardo M. Lima, Ignacio E. Grossmann

Computational Optimization and Applications•Jun 16, 2016•25 citations

A Polyhedral Approach for Nonconvex Quadratic Programming Problems with Box

安敏 矢島, Yasutoshi Yajima

•Jan 1, 1998•0 citations

Semidefinite Programming Based Convex Relaxation for Nonconvex Quadratically Constrained Quadratic Programming

Rujun Jiang, Duan Li

Advances in intelligent systems and computing•Jun 14, 2019•3 citations