Copositive optimization–recent developments and applications
IM Bomze - European Journal of Operational Research, 2012 - Elsevier
Due to its versatility, copositive optimization receives increasing interest in the Operational
Research community, and is a rapidly expanding and fertile field of research. It is a special …
Research community, and is a rapidly expanding and fertile field of research. It is a special …
[BUCH][B] Simplicial partitions in global optimization
R Paulavičius, J Žilinskas, R Paulavičius, J Žilinskas - 2014 - Springer
Simplicial Partitions in Global Optimization | SpringerLink Skip to main content
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your …
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your …
A complete semidefinite algorithm for detecting copositive matrices and tensors
A real symmetric tensor is said to be copositive if the associated homogeneous form is
greater than or equal to zero over the nonnegative orthant. The problem of detecting tensor …
greater than or equal to zero over the nonnegative orthant. The problem of detecting tensor …
Think co (mpletely) positive! Matrix properties, examples and a clustered bibliography on copositive optimization
IM Bomze, W Schachinger, G Uchida - Journal of Global Optimization, 2012 - Springer
Copositive optimization is a quickly expanding scientific research domain with wide-spread
applications ranging from global nonconvex problems in engineering to NP-hard …
applications ranging from global nonconvex problems in engineering to NP-hard …
Conic formulation of QPCCs applied to truly sparse QPs
IM Bomze, B Peng - Computational Optimization and Applications, 2023 - Springer
We study (nonconvex) quadratic optimization problems with complementarity constraints,
establishing an exact completely positive reformulation under—apparently new—mild …
establishing an exact completely positive reformulation under—apparently new—mild …
On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
In the paper we prove that any nonconvex quadratic problem over some set K ⊂ R^ n with
additional linear and binary constraints can be rewritten as a linear problem over the cone …
additional linear and binary constraints can be rewritten as a linear problem over the cone …
The copositive cone, the completely positive cone and their generalisations
PJC Dickinson - 2013 - research.rug.nl
In het leven streven we vaak naar het beste, of het er nu om gaat het snelste te zijn, het
sterkste, het meest efficiënt of het meest precies. Wiskundige optimalisatie is hierbij een …
sterkste, het meest efficiënt of het meest precies. Wiskundige optimalisatie is hierbij een …
Using -Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA
Principal component analysis (PCA) is one of the most widely used dimensionality reduction
tools in scientific data analysis. The PCA direction, given by the leading eigenvector of a …
tools in scientific data analysis. The PCA direction, given by the leading eigenvector of a …
An improved algorithm to test copositivity
J Sponsel, S Bundfuss, M Dür - Journal of Global Optimization, 2012 - Springer
Copositivity plays a role in combinatorial and nonconvex quadratic optimization. However,
testing copositivity of a given matrix is a co-NP-complete problem. We improve a previously …
testing copositivity of a given matrix is a co-NP-complete problem. We improve a previously …
Copositivity and constrained fractional quadratic problems
P Amaral, IM Bomze, J Júdice - Mathematical Programming, 2014 - Springer
Abstract We provide Completely Positive and Copositive Optimization formulations for the
Constrained Fractional Quadratic Problem (CFQP) and Standard Fractional Quadratic …
Constrained Fractional Quadratic Problem (CFQP) and Standard Fractional Quadratic …