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

DOI10.1007/BF02243852zbMATH Open0791.65043OpenAlexW409577983MaRDI QIDQ1310620FDOQ1310620

Authors: 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

Recommendations

• Local minimizer of a nonconvex quadratic programming problem
• scientific article; zbMATH DE number 764402
• Cycling in linear programming problems
• On cycling in the simplex method of the transportation problem
• Note on a sufficient condition for a local minimum of a class of nonconvex quadratic programs

zbMATH Keywords

counterexamplecyclingnonconvex quadratic programmingBeale's algorithm

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Local minimizer of a nonconvex quadratic programming problem

Cited In (2)

• Local minimizer of a nonconvex quadratic programming problem
• Cycling in linear programming problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1310620)