Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming

DOI10.3934/jimo.2013.9.703zbMath1281.90036OpenAlexW2333299567WikidataQ57426607 ScholiaQ57426607MaRDI QIDQ380506

Ye Tian, Shu-Cherng Fang, Wen-Xun Xing, Zhi-bin Deng

Publication date: 14 November 2013

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2013.9.703

zbMATH Keywords

completely positive programming approximation adaptive scheme cone of nonnegative quadratic forms general nontrivial second-order cone

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Approximation in the complex plane (30E10)

Related Items (7)

An efficient cutting plane algorithm for the smallest enclosing circle problem ⋮ Conic approximation to quadratic optimization with linear complementarity constraints ⋮ Cardinality constrained portfolio selection problem: a completely positive programming approach ⋮ Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems ⋮ Quadratic optimization over one first-order cone ⋮ A new conic approach to semisupervised support vector machines ⋮ Quadratic optimization over a polyhedral cone

This page was built for publication: Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming