Global minimization algorithms for concave quadratic programming problems
type: Item
instance of: scholarly article
title: Global minimization algorithms for concave quadratic programming problems
zbMATH Open document ID: 1147.90385
DOI: 10.1080/02331930500342534
author: Altannar Chinchuluun
author: R. Enkhbat
author: Panos M. Pardalos
published in: Optimization
publication date: 2008-11-04T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 5360986
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/02331930500342534
OpenAlex ID: W2070063692
cites work: A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables
cites work: Necessary and sufficient global optimality conditions for convex maximization revisited
cites work: An algorithm for maximizing a convex function over a simple set
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: Methods for Global Concave Minimization: A Bibliographic Survey
cites work: Global optimality conditions for nonconvex optimization
cites work: On the construction of test problems for concave minimization algorithms
description: scientific article