A Simplicial Algorithm for Stationary Point Problems on Polytopes

DOI10.1287/MOOR.14.3.383MaRDI QIDQ3829360zbMATH OpenOpenAlexFDO

Authors Yoshitsugu Yamamoto, Dolf 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) Linear programming (90C05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Variational inequalities (49J40)

Recommendations

• A PATH FOLLOWING ALGORITHM FOR STATIONARY POINT PROBLEMS
• A Simplicial Algorithm for Computing Robust Stationary Points of a Continuous Function on the Unit Simplex
• A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron
• THE PATH FOLLOWING ALGORITHM FOR STATIONARY POINT PROBLEMS ON POLYHEDRAL CONES
• Linear Stationary Point Problems on Unbounded Polyhedra

Cited in

(19)

• scientific article; zbMATH DE number 1418042 (Why is no real title available?)
• scientific article; zbMATH DE number 1629847 (Why is no real title available?)
• A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems
• A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron
• A path-following procedure to find a proper equilibrium of finite games
• A PATH FOLLOWING ALGORITHM FOR STATIONARY POINT PROBLEMS
• A Simplicial Algorithm for Computing Robust Stationary Points of a Continuous Function on the Unit Simplex
• scientific article; zbMATH DE number 4119955 (Why is no real title available?)
• THE PATH FOLLOWING ALGORITHM FOR STATIONARY POINT PROBLEMS ON POLYHEDRAL CONES
• scientific article; zbMATH DE number 4073956 (Why is no real title available?)
• 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\)
• On a parameterized system of nonlinear equations with economic applications
• Existence of equilibrium and price adjustments in a finance economy with incomplete markets
• A triangulation and fill-reducing initialization procedure for the simplex algorithm
• A continuous deformation algorithm for variational inequality problems on polytopes
• Linear Stationary Point Problems on Unbounded Polyhedra
• A fixed point theorem for discontinuous functions
• A better triangulation for Wright's \(2^n\)-ray algorithm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3829360)