Extension of optimality conditions via supporting functions
From MaRDI portal
Cites work
- A theorem of the alternative with application to convex programming: optimality, duality, and stability
- Algorithms for some minimax problems
- An Algorithm for Separable Nonconvex Programming Problems
- Convex Analysis
- Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case
- Generalized Benders decomposition
- scientific article; zbMATH DE number 3291743 (Why is no real title available?)
- scientific article; zbMATH DE number 3296906 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- scientific article; zbMATH DE number 3310599 (Why is no real title available?)
- scientific article; zbMATH DE number 3345848 (Why is no real title available?)
- scientific article; zbMATH DE number 3416582 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- Necessary optimality criteria in mathematical programming in the presence of differentiability
- On the cones of tangents with applications to mathematical programming
- Optimality Criteria in Nonlinear Programming Without Differentiability
- The Lagrange Multiplier Theorem for Max-Min with Several Constraints
- The Theory of Max-Min, with Applications
This page was built for publication: Extension of optimality conditions via supporting functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4770221)