Global optimality conditions for nonlinear programming problems with linear equality constraints
From MaRDI portal
Publication:2336220
DOI10.1155/2014/213178zbMath1437.90149OpenAlexW2116379513WikidataQ59050303 ScholiaQ59050303MaRDI QIDQ2336220
Publication date: 19 November 2019
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/213178
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Unnamed Item
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma
- Conditions for global optimality. II
- Handbook of global optimization. Vol. 2
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- New Results on Quadratic Minimization
- A conic trust-region method for nonlinearly constrained optimization
- A new trust-region algorithm for equality constrained optimization
This page was built for publication: Global optimality conditions for nonlinear programming problems with linear equality constraints
