scientific article; zbMATH DE number 7413562

MaRDI QIDQ5158522zbMATH OpenFDO

Authors Ridelio Miranda Pérez, Boris Pérez Cañedo, S. M. Allende-Alonso, G. 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

zbMATH Keywords

branch-and-bounddouble non negative relaxationnon-convex quadratic programmingparametric optimizationsemidefinite programming

Mathematics Subject Classification ID

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

Recommendations

• On nonconvex quadratic programming with box constraints
• A polyhedral approach for nonconvex quadratic programming problems with box constraints
• scientific article; zbMATH DE number 1372689
• A polyhedral study of nonconvex quadratic programs with box constraints
• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
• A class of methods for solving large, convex quadratic programs subject to box constraints
• scientific article; zbMATH DE number 4199975
• A hybrid method for solving systems of nonsmooth equations with box constraints
• On box constrained concave quadratic optimization
• Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods

Cites work

• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
• Critical sets in parametric optimization
• Globally solving nonconvex quadratic programming problems via completely positive programming
• scientific article; zbMATH DE number 47206 (Why is no real title available?)
• scientific article; zbMATH DE number 1531626 (Why is no real title available?)
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Quadratic programming with one negative eigenvalue is NP-hard
• Relaxing the optimality conditions of box QP
• Some NP-complete problems in quadratic and nonlinear programming
• Theoretical approach for the calculation of a feasible point of the special non-convex set described by a polyhedron and a quadratic function

Describes a project that uses

Uses Software

• QuadProgBB

This page was built for publication:

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