A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron

DOI10.1137/0801012zbMath0754.90066MaRDI QIDQ4012418

Gerard van der Laan, Yang Dai, Yoshitsugu Yamamoto, Adolphus J. J. Talman

Publication date: 27 September 1992

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://pure.uvt.nl/portal/en/publications/a-simplicial-algorithm-for-the-nonlinear-stationary-point-problem-on-an-unbounded-polyhedron(82992276-1868-4b56-a937-0955e80520e6).html

zbMATH Keywords

path-following algorithm; simplicial algorithm; convergence condition; nonlinear stationary point problem; subdivided manifold

Mathematics Subject Classification ID

65H20: Global methods, including homotopy approaches to the numerical solution of nonlinear equations

52A20: Convex sets in (n) dimensions (including convex hypersurfaces)

90-08: Computational methods for problems pertaining to operations research and mathematical programming

90C99: Mathematical programming

Related Items

The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\), A continuous deformation algorithm for variational inequality problems on polytopes, Existence of equilibrium and price adjustments in a finance economy with incomplete markets