scientific article; zbMATH DE number 7305738
From MaRDI portal
Publication:5148358
zbMath1474.90314MaRDI QIDQ5148358
Kim-Chuan Toh, Kojima, Masakazu, Naohiko Arima, Sunyoung Kim
Publication date: 3 February 2021
Full work available at URL: http://www.yokohamapublishers.jp/online-p/PJO/vol14/pjov14n1p161.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
convexificationLagrangian-conic relaxationdoubly nonnegative relaxationquadratic optimization problemscompletely positive programming relaxationexploiting sparsity
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints, Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures, A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems, Amenable cones: error bounds without constraint qualifications, A robust Lagrangian-DNN method for a class of quadratic optimization problems, Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems, Polyhedral approximations of the semidefinite cone and their application, Algorithm 996, A Newton-bracketing method for a simple conic optimization problem
