Advertisement

Introduction

  • Alexander Rubinov
  • Xiaoqi Yang
Part of the Applied Optimization book series (APOP, volume 85)

Abstract

Consider the following mathematical programming problem with inequality constraints:
(1.1)
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).

Keywords

Penalty 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2003

Authors and Affiliations

  • Alexander Rubinov
    • 1
  • Xiaoqi Yang
    • 2
  1. 1.School of Information Technology and Mathematical SciencesUniversity of BallaratVictoriaAustralia
  2. 2.Department of Applied MathematicsHong Kong Polytechnic UniversityHong KongChina

Personalised recommendations