Local minimizer of a nonconvex quadratic programming problem

descriptionPublicationkeyboard_double_arrow_right Article 01 Sep 1990 English Publisher:Springer Science and Business Media LLCJournal:Computing, volume 45, pages 283-289 (issn: 0010-485X, eissn: 1436-5057,

Copyright policy )

Authors: Frantisek Mráz;

doi: 10.1007/bf02250640

Local minimizer of a nonconvex quadratic programming problem

- Summary
- Metrics

Abstract

A modified Beale's algorithm is described which computes the local minimizer of any quadratic objective function subject to linear constraints. Some extensions are given, first of all the possibility of movement to the neighbouring local minimizer with a reduced objective function value in some special cases.

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	2
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average