Inexact Active Constraints

  • Ding-Zhu Du
  • Panos M. Pardalos
  • Weili Wu
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 56)

Abstract

When an approximate value is computed from each computation, one may have difficulty to decide whether a constraint is active or not. One strategy, called ε-active set strategy, is used to overcome this obstacle by treating near-active constraints just like active constraints. We study this topic in this chapter.

Keywords

Extreme Point Feasible Region Global Convergence Tangent Plane Feasible Point 
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 2001

Authors and Affiliations

  • Ding-Zhu Du
    • 1
  • Panos M. Pardalos
    • 2
  • Weili Wu
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of MinnesotaMinneapolisUSA
  2. 2.Center for Applied Optimization, ISE DepartmentUniversity of FloridaGainesvilleUSA

Personalised recommendations