A hybrid direction algorithm for solving a convex quadratic problem

DOI10.1504/IJMOR.2020.105862zbMath1452.90234OpenAlexW4247498341MaRDI QIDQ2214190

Mohand Ouamer Bibi, Mohand Bentobache, Nacira Ikheneche

Publication date: 7 December 2020

Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijmor.2020.105862

zbMATH Keywords

numerical experimentsconvex quadratic programmingadaptive methodbounded variableshybrid directionoptimality estimate

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items (2)

Numerical approach to solve imprecisely defined systems using inner outer direct search optimization technique ⋮ Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems

Uses Software

• Matlab

This page was built for publication: A hybrid direction algorithm for solving a convex quadratic problem