scientific article; zbMATH DE number 7413562

zbMath1479.90151MaRDI QIDQ5158522

Boris Pérez Cañedo, Ridelio Miranda Pérez, S.M.Allende-Alonso, Gemayqzel Bouza Allende

Publication date: 25 October 2021

Full work available at URL: http://archives-web.univ-paris1.fr/rev-inv-ope/fileadmin/rev-inv-ope/files/39118/39118-04.pdf

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

zbMATH Keywords

parametric optimizationsemidefinite programmingbranch-and-boundnon-convex quadratic programmingdouble non negative relaxation

Mathematics Subject Classification ID

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

Uses Software

• QuadProgBB

Cites Work

• Unnamed Item
• Unnamed Item
• Relaxing the optimality conditions of box QP
• Quadratic programming with one negative eigenvalue is NP-hard
• Globally solving nonconvex quadratic programming problems via completely positive programming
• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
• On the copositive representation of binary and continuous nonconvex quadratic programs
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
• Theoretical approach for the calculation of a feasible point of the special non-convex set described by a polyhedron and a quadratic function
• Critical sets in parametric optimization
• Some NP-complete problems in quadratic and nonlinear programming

This page was built for publication: