Cycling can occur in Mráz's algorithm for nonconvex quadratic programming

DOI10.1007/BF02243852zbMath0791.65043OpenAlexW409577983MaRDI QIDQ1310620

Hannu Väliaho

Publication date: 7 July 1994

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02243852

zbMATH Keywords

nonconvex quadratic programmingcounterexamplecyclingBeale's algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Cites Work

• Local minimizer of a nonconvex quadratic programming problem
• Unnamed Item

This page was built for publication: Cycling can occur in Mráz's algorithm for nonconvex quadratic programming