Optimality conditions using sum-convex approximations
From MaRDI portal
Publication:1146114
DOI10.1007/BF00934928zbMath0446.90070MaRDI QIDQ1146114
Publication date: 1981
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
optimality conditions; necessary and sufficient conditions; theorems of the alternative; sum-convex approximations
90C25: Convex programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theorems of the alternative for complex linear inequalities
- A theorem of the alternative with application to convex programming: optimality, duality, and stability
- Various definitions of the derivative in mathematical programming
- On the convex approximation of nonlinear inequalities
- On the general minimax theorem
- Various definitions of the derivative in mathematical programming — an addendum
- Directionally Lipschitzian Functions and Subdifferential Calculus
- An Abstract Variational Theory with Applications to a Broad Class of Optimization Problems. I. General Theory
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- The various definitions of the derivative in linear topological spaces
- Asymptotic Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space