Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma

DOI10.1007/s11590-008-0088-3zbMath1154.90574WikidataQ124828007 ScholiaQ124828007MaRDI QIDQ1001322

Vaithilingam Jeyakumar, S. Srisatkunarajah

Publication date: 17 February 2009

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-008-0088-3

zbMATH Keywords

Lagrange multipliers; fractional programs; global optimality; difference of quadratic and convex functions; single quadratic constraint; smooth non-convex minimization

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C46: Optimality conditions and duality in mathematical programming

90C32: Fractional programming