scientific article; zbMATH DE number 6472515
From MaRDI portal
zbMath1327.90181MaRDI QIDQ5501735
Publication date: 14 August 2015
Full work available at URL: http://www.yokohamapublishers.jp/online2/oppjo/vol11/p101.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear programmingcopositive programmingbranch and bound algorithmmaximum clique problemmatrix decomposition
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Combinatorial optimization (90C27) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Related Items
LP-based tractable subcones of the semidefinite plus nonnegative cone, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, Copositivity tests based on the linear complementarity problem, A modified simplex partition algorithm to test copositivity