MINQ8: general definite and bound constrained indefinite quadratic programming
type: Item
instance of: scholarly article
title: MINQ8: general definite and bound constrained indefinite quadratic programming
zbMATH Open document ID: 1400.90240
author: Arnold Neumaier
author: Waltraud Huyer
published in: Computational Optimization and Applications
publication date: 2018-04-20T00:00:00Z
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 6862296
zbMATH Keywords: definite quadratic programming
zbMATH Keywords: bound constrained indefinite quadratic programming
zbMATH Keywords: dual program
zbMATH Keywords: certificate of infeasibility
Wikidata QID: Q59607599
describes a project that uses: MCS
describes a project that uses: Matlab
describes a project that uses: CUTEr
describes a project that uses: SNOBFIT
describes a project that uses: SifDec
describes a project that uses: NewtonKKTqp
MaRDI profile type: Publication
full work available at URL: s10589-017-9949-y
OpenAlex ID: W2762271916
cites work: Newton-KKT interior-point methods for indefinite quadratic programming
cites work: A collection of test problems for constrained global optimization algorithms
cites work: Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
cites work: CUTEr and SifDec
cites work: Iterative Methods for Large Convex Quadratic Programs: A Survey
cites work: Introduction to global optimization.
cites work: Global optimization by multilevel coordinate search
cites work: Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems
cites work: Simultaneous Scatterer Shape Estimation and Partial Aperture Far-Field Pattern Denoising
cites work: A non-interior path following method for convex quadratic programming problems with bound constraints
DOI: 10.1007/S10589-017-9949-Y
description: scientific article; zbMATH DE number 6862296