Application of a facial reduction algorithm and an inexact primal-dual path-following method for doubly nonnegative relaxation for mixed binary nonconvex quadratic optimization problems

MaRDI QIDQ4906145zbMATH OpenFDO

Authors Mirai Tanaka, Kazuhide Nakata, Hayato Waki

Publication date 7 February 2013

Full work available at URL http://www.yokohamapublishers.jp/online2/oppjo/vol8/p699.html

zbMATH Keywords

numerical resultsconvergence accelerationnumerical stabilitysemidefinite optimizationKrylov subspace methoddoubly nonnegative relaxationpath-following methodinterior-point methodnonconvex quadratic optimizationprimal-dual methodsfacial reduction algorithmcompletely positive optimizationpreconditioned symmetric quasi-minimal residual method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25) Interior-point methods (90C51) Semidefinite programming (90C22) Iterative numerical methods for linear systems (65F10) Mixed integer programming (90C11)

Recommendations

• Numerical reduction method for doubly nonnegative optimization problems
• Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
• Fixed point theory for permissible extension type maps
• Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
• A robust Lagrangian-DNN method for a class of quadratic optimization problems

Cited in

(2)

• Numerical reduction method for doubly nonnegative optimization problems
• Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints

This page was built for publication: Application of a facial reduction algorithm and an inexact primal-dual path-following method for doubly nonnegative relaxation for mixed binary nonconvex quadratic optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4906145)