Computational experience with the Chow—Yorke algorithm
From MaRDI portal
Publication:3877429
DOI10.1007/BF01581630zbMath0436.90096MaRDI QIDQ3877429
Publication date: 1980
Published in: Mathematical Programming (Search for Journal in Brave)
global convergencenonlinear complementarity problemnonlinear equationsnonlinear two-point boundary value problemscomputational experienceconvex minimizationcomputation of fixed pointsChow-Yorke algorithmnonsimplicial homotopy type methodzero finding problems
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Fixed-point and coincidence theorems (topological aspects) (54H25)
Related Items (8)
A new predictor-corrector method for solving unconstrained minimization problems ⋮ Solving spline-collocation approximations to nonlinear two-point boundary-value problems by a homotopy method ⋮ Modern homotopy methods in optimization ⋮ Engineering applications of the Chow-Yorke algorithm ⋮ Sensitivity analysis for the asymmetric network equilibrium problem ⋮ Globally convergent homotopy methods: A tutorial ⋮ In search of valid results in a complex economic environment: The potential of meta-analysis and value transfer ⋮ A globally convergent method for finding zeros of smooth functions
Cites Work
- A globally convergent algorithm for computing fixed points of \(C^2\) maps
- Squeezing of a viscous fluid between elliptic plates
- An Algorithm That is Globally Convergent with Probability One for a Class of Nonlinear Two-Point Boundary Value Problems
- Algorithm 555: Chow-Yorke Algorithm for Fixed Points or Zeros of C 2 Maps [C5]
- Optimal design by a homotopy method
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
- Computational complexity of complementary pivot methods
- On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting
- Efficient Acceleration Techniques for Fixed Point Algorithms
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
- Solving the Nonlinear Complementarity Problem by a Homotopy Method
- Homotopies for computation of fixed points
- The Approximation of Fixed Points of a Continuous Mapping
- The Solution of Nonlinear Systems of Equations by A-Stable Integration Techniques
- Homotopies for computation of fixed points on unbounded regions
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computational experience with the Chow—Yorke algorithm
