scientific article; zbMATH DE number 221928

DOI10.1002/1520-6750(199304)40:3%3C373::AID-NAV3220400307%3E3.0.CO;2-AzbMATH Open0782.90071MaRDI QIDQ4697332FDOQ4697332

Michèle Ruiz, Junjie Xiong, Pierre Hansen, Brigitte Jaumard

Publication date: 29 June 1993

Title of this publication is not available (Why is that?)

Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

Title not available (Why is that?)

Cited In (22)

Title not available (Why is that?)
Quadratic optimization over a polyhedral cone
Box-constrained quadratic programs with fixed charge variables
New optimality conditions for quadratic optimization problems with binary constraints
Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
Solutions to quadratic minimization problems with box and integer constraints
Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
An LPCC approach to nonconvex quadratic programs
A polyhedral study of nonconvex quadratic programs with box constraints
A computational comparison of some branch and bound methods for indefinite quadratic programs
A new algorithm for the general quadratic programming problems with box constraints
Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
Solutions and optimality criteria for nonconvex quadratic-exponential minimization problem
A computational study on QP problems with general linear constraints
Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
Compact mixed-integer programming formulations in quadratic optimization
A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
Domain reduction techniques for global NLP and MINLP optimization
Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
A binarisation heuristic for non-convex quadratic programming with box constraints

   Recommendations

Global minimization of indefinite quadratic problems 👍 👎
An algorithm for global minimization of linearly constrained quadratic functions 👍 👎
Title not available (Why is that?) 👍 👎
Title not available (Why is that?) 👍 👎
An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints 👍 👎

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 Q4697332)