A Simplicial Algorithm for Stationary Point Problems on Polytopes

DOI10.1287/moor.14.3.383zbMath0674.90084OpenAlexW2121885849MaRDI QIDQ3829360

Yoshitsugu Yamamoto, Adolphus J. J. Talman

Publication date: 1989

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://pure.uvt.nl/portal/en/publications/a-simplicial-algorithm-for-stationary-point-problems-on-polytopes(d08a8960-604c-43c9-a1f9-98984f1341dc).html

zbMATH Keywords

polytopestationary point problemsimplicial variable dimension restart algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Variational inequalities (49J40) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (9)

A continuous deformation algorithm for variational inequality problems on polytopes ⋮ A better triangulation for Wright's \(2^n\)-ray algorithm ⋮ A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems ⋮ On a parameterized system of nonlinear equations with economic applications ⋮ A fixed point theorem for discontinuous functions ⋮ A path-following procedure to find a proper equilibrium of finite games ⋮ Existence of equilibrium and price adjustments in a finance economy with incomplete markets ⋮ A lexicographic algebraic theorem and its applications ⋮ The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\)

This page was built for publication: A Simplicial Algorithm for Stationary Point Problems on Polytopes