Simplicial zero-point algorithms: A unifying description

DOI10.1007/BF00938483MaRDI QIDQ1061618zbMATH OpenOpenAlexFDO

Authors Gerard van der Laan, Dolf Talman

Publication date 1986

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00938483

zbMATH Keywords

stationary pointsimplicial algorithmslimiting pathsMerrill's condition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Numerical computation of solutions to systems of equations (65H10) Homotopy theory (55P99)

Recommendations

• Efficiency and implementation of simplicial zero point algorithms
• Simplicial Algorithm to Find Zero Points of a Function with Special Structure on a Simplotope
• A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron
• A Simplicial Algorithm for Computing Robust Stationary Points of a Continuous Function on the Unit Simplex
• Publication:4734679

Cites work

• scientific article; zbMATH DE number 3862340 (Why is no real title available?)
• scientific article; zbMATH DE number 3728015 (Why is no real title available?)
• scientific article; zbMATH DE number 3728016 (Why is no real title available?)
• A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems
• A Modified Integer Labeling for Complementarity Algorithms
• A class of simplicial restart fixed point algorithms without an extra dimension
• A new variable dimension algorithm for the fixed point problem
• A restart algorithm for computing fixed points without an extra dimension
• A simplicial approximation of a solution for the nonlinear complementarity problem
• A unification of the existence theorems of the nonlinear complementarity problem
• A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
• A variable-dimension simplicial algorithm for antipodal fixed-point theorems
• An improvement of fixed point algorithms by using a good triangulation
• Approximate Labelling for Simplicial Algorithms and Two Classes of Special Subsets of the Sphere
• Computing stationary points
• Equilibrium programming:The path following approach and dynamics
• Extension of the Generalized Complementarity Problem
• Interpretation of a Variable Dimension Fixed Point Algorithm with an Artificial Level
• Note on the path following approach of equilibrium programming
• On the basic theorem of complementarity
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• The octahedral algorithm, a new simplicial fixed point algorithm
• Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods

Cited in

(5)

• A Simplicial Algorithm for Computing Robust Stationary Points of a Continuous Function on the Unit Simplex
• scientific article; zbMATH DE number 4073956 (Why is no real title available?)
• scientific article; zbMATH DE number 69503 (Why is no real title available?)
• Efficiency and implementation of simplicial zero point algorithms
• Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds

This page was built for publication: Simplicial zero-point algorithms: A unifying description

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