The Computation of Stationary Points on General Polytopes

  • Zaifu Yang
Part of the Theory and Decision Library book series (TDLC, volume 21)

Abstract

In this chapter we introduce an algorithm to solve the nonlinear stationary point problem on general polytopes in ℝ n . Recall that given an arbitrary polytope P and a function f: P ↦ ℝ n the problem of stationary point (or variational inequality) for f on P is to find a point x* ∈ P such that
$${({x^*} - x)^T}f({x^*}) \geqslant 0$$
, for all x ∈ P .

Keywords

Stationary Point Zero Point Basic Theorem Basic Feasible Solution Simplicial Subdivision 
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 1999

Authors and Affiliations

  • Zaifu Yang
    • 1
  1. 1.Yokohama National UniversityJapan

Personalised recommendations