Remarks on second-order conditions in connection with the algorithm of Beale for quadratic programming

DOI10.1016/0377-2217(89)90275-0zbMath0683.90058OpenAlexW1989003011MaRDI QIDQ1825132

Frank Koerner

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90275-0

zbMATH Keywords

optimality conditionssecond-order conditionsKuhn-Tucker pointBeale algorithm

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items (2)

A note on weakly active constraints in connection with nonconvex quadratic programming ⋮ On the numerical realization of the exact penalty method for quadratic programming algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Criteria for copositive matrices
• On classes of copositive matrices
• Equivalence of some quadratic programming algorithms
• On the Location of Directions of Infinite Descent for Nonlinear Programming Algorithms
• A unified approach to one-parametric general quadratic programming
• Behandlung parametriseher quadratischer optimierangsprobleme mit der methode yon beaie
• An Inverse-Basis Method for Beale's Quadratic Programming Algorithm

This page was built for publication: Remarks on second-order conditions in connection with the algorithm of Beale for quadratic programming