A computational study of global optimization solvers on two trust region subproblems.

J Glob Optim · 2018 · PMC6417392 · PMID 30956397

Europe PMC DOI

hedged sentence

—

closest p

—

boldest claim

The sentences

may be significantno p-value reported

The Lagrangian dual of ( 1 ) is a semidefinite program and hence is convex and can be solved efficiently [ 5 ]; unfortunately, the duality gap may be significant.

also in 13,097 other papers

Quoted from the open-access full text in Europe PMC under the licence the publisher applied. The sentence is reproduced exactly as published; the emphasis is ours.