Optimality conditions using sum-convex approximations

DOI10.1007/BF00934928zbMath0446.90070OpenAlexW2060737136MaRDI QIDQ1146114

Hélène Massam

Publication date: 1981

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00934928

zbMATH Keywords

optimality conditionsnecessary and sufficient conditionstheorems of the alternativesum-convex approximations

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimality conditions using sum-convex approximations