Part of the Applied Optimization book series (APOP, volume 85)
Consider the following mathematical programming problem with inequality constraints:where f and g i , i = 1,…, m are real-valued functions defined on a metric space X. Let g(x) = (g 1 (x),…, g m (x)). We consider g as a map defined on X and mapping into ℝ m . Denote the problem (1.1.1) as P(f, g).
KeywordsPenalty Function Augmented Lagrangian Method Perturbation Function Unconstrained Problem Weak Duality
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 Dordrecht 2003