SIMPLICIAL APPROXIMATION OF FIXED POINTS

From MaRDI portal
Publication:5586068

DOI10.1073/pnas.61.4.1238zbMath0191.54904OpenAlexW1969768653WikidataQ36476039 ScholiaQ36476039MaRDI QIDQ5586068

Harold W. Kuhn

Publication date: 1968

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://europepmc.org/articles/pmc225246




Related Items (54)

Pivotal methods for computing equilibrium points: Unified approach and new restart algorithmThe Homotopy Continuation Method: Numerically Implementable Topological ProceduresOn the complexity of an expanded Tarski's fixed point problem under the componentwise orderingConstructing pure-exchange economies with many equilibriaOn the stability of finding approximate fixed points by simplicial methodsFinding Zeroes of Maps: Homotopy Methods That are Constructive With Probability OneA differentiable homotopy approach for solving polynomial optimization problems and noncooperative gamesSolving non-monotone equilibrium problems via a DIRECT-type approachA better triangulation for Wright's \(2^n\)-ray algorithmA direct proof of the Gale-Nikaido-Debreu lemma using Sperner's lemmaNotes on computation of Kakutani fixed pointsDecomposability in fixed point computation with applications and acceleration techniquesA POINT BASIS FOR MULTIVARIABLE PIECEWISE LINEAR INTERPOLATION AND DESIGN CENTERINGA family of symmetric, optimized quadrature rules for pentatopesA simplicial algorithm for the nonlinear complementarity problemThe (2 n+1−2)-ray algorithm: A new simplicial algorithm to compute economic equilibriaSolving discrete systems of nonlinear equationsA set intersection theorem and applicationsExponential lower bounds for finding Brouwer fixed pointsTatonnement beyond gross substitutes? Gradient descent to the rescueFixed points for fuzzy mappingsHomotopies for computation of fixed points on unbounded regionsAchieving Rental Harmony with a Secretive Roommate\(\tilde K'_ 3\)- A new triangulation of \(R^ n\)An Odd TheoremIsometric Embedding of Curvilinear Meshes Defined on Riemannian Metric SpacesForeword. What is numerical algebraic geometry?Digital architectures realizing piecewise-linear multivariate functions: Two FPGA implementationsA fixed point theorem including the last theorem of PoincaréThe complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form gameOn generalizing shapley's index theory to labelled pseudomanifoldsComputing an integer point of a class of convex sets.Combinatorial integer labeling theorems on finite sets with applicationsA unified approach to complementarity in optimizationComputing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithmA simplicial approximation of a solution for the nonlinear complementarity problemSandwich method for finding fixed pointsKombinatorik bewerteter KomplexeHomotopies for computation of fixed pointsAn institutionalized Divvy economyPiecewise linear approximations of multivariate functions: A multiresolution-based compression algorithm suitable for circuit implementationExistence of balanced simplices on polytopes.Comparative computer results of a new complementary pivot algorithm for solving equality and inequality constrained optimization problemsMultiple-source adaptation theory and algorithmsNo bullying! A playful proof of Brouwer's fixed-point theoremStable processes of exchangeA PL homotopy for finding all the roots of a polynomialScalar labelings for homotopy pathsUnnamed ItemHomeomorphisms of triangulations with applications to computing fixed pointsCombinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedronA polytopal generalization of Sperner's lemmaFinite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applicationsPermutation congruent transformations of the freudenthal triangulation with minimum surface density




This page was built for publication: SIMPLICIAL APPROXIMATION OF FIXED POINTS