Perfect duality for convexlike programs
From MaRDI portal
Publication:1157569
DOI10.1007/BF00934081zbMath0471.49033MaRDI QIDQ1157569
Publication date: 1982
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
duality gap; Lagrangian function; necessary condition for optimality; maximizing problem; minimizing problem; convex Gateaux derivative; convexlike programs perfect duality
58C20: Differentiation theory (Gateaux, Fréchet, etc.) on manifolds
49K35: Optimality conditions for minimax problems
90C55: Methods of successive quadratic programming type