Part of the Springer Series in Operations Research book series (ORFE)
In this chapter we discuss first and second order optimality conditions for the optimization problem, where f : X → IR, G : X → Y and Q and K are a nonempty closed convex subsets of X and Y, respectively. We can view the set Q as the domain of the objective function f. Unless stated otherwise, we assume that X and Y are Banach spaces and that f(x) and G(x) are continuous.
KeywordsLagrange Multiplier Feasible Point Constraint Qualification Exact Penalty Function Critical Cone
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer Science+Business Media New York 2000