scientific article

zbMath1327.90161MaRDI QIDQ2928409

Kojima, Masakazu, Sunyoung Kim, Naohiko Arima

Publication date: 7 November 2014

Full work available at URL: http://www.yokohamapublishers.jp/online2/oppjo/vol10/p437.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Lagrangian relaxationnonconvex quadratic optimization0-1 mixed integer programcompletely positive programming relaxationcopositve programming relaxation

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (12)

Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization ⋮ Conic approximation to quadratic optimization with linear complementarity constraints ⋮ A fresh CP look at mixed-binary QPs: new formulations and relaxations ⋮ Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques ⋮ Binary quadratic optimization problems that are difficult to solve by conic relaxations ⋮ A robust Lagrangian-DNN method for a class of quadratic optimization problems ⋮ Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems ⋮ Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches ⋮ Simplified semidefinite and completely positive relaxations ⋮ A Newton-bracketing method for a simple conic optimization problem ⋮ Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems ⋮ A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems

This page was built for publication: