×

Une caractérisation complete des minima locaux en programmation quadratique. (French) Zbl 0422.90061


MSC:

90C20 Quadratic programming
65K05 Numerical mathematical programming methods
PDFBibTeX XMLCite
Full Text: DOI EuDML

References:

[1] Contesse, L.: Sur les cônes et les polyèdres convexes en optimisation. Thèse de Docteur Ingénieur en Mathématiques, Appliqueés, Université des Sciences et Techniques de Lille, France, 1977
[2] Fiacco, A.V.: Second order sufficient conditions for weak and strict constrained minima. SIAM J. Appl. Math.16, 105-108, 1968 · Zbl 0157.49604 · doi:10.1137/0116008
[3] Hestenes, M.A.: Optimisation theory, The finite dimensional case. New York: Wiley 1975 · Zbl 0327.90015
[4] Huard, P.: Optimisation dans ? n (programmation mathématique), première partie: Éléments théoriques, Cours de 3ème Cycle, Université des Sciences et Techniques de Lille, 1972
[5] Majthay, A.: Optimality conditions for quadratic programming. Math. Programming1, 359-365, 1971 · Zbl 0246.90038 · doi:10.1007/BF01584097
[6] Mc Cormick, G.: Second order optimality conditions for constrained minima. SIAM J. Appl. Math.15, 641-652, 1967 · Zbl 0166.15601 · doi:10.1137/0115056
[7] Orden, A.: Stationary points of quadratic functions under linear constraints. Comput. J.7, 238-242, 1964 · Zbl 0132.40104 · doi:10.1093/comjnl/7.3.238
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.