An efficient simplicial algorithm for computing a zero of a convex union of smooth functions
- 1 January 1983
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 25 (1) , 83-108
- https://doi.org/10.1007/bf02591720
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A class of simplicial restart fixed point algorithms without an extra dimensionMathematical Programming, 1981
- A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimizationMathematical Programming, 1980
- An Index Theorem for General Equilibrium Models with ProductionEconometrica, 1980
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of EquationsSIAM Review, 1980
- A note on computing equilibria in economies with activity analysis models of productionJournal of Mathematical Economics, 1979
- Improving the convergence of fixed-point algorithmsPublished by Springer Nature ,1978
- On the homotopic approach to systems of equations with separable mappingsPublished by Springer Nature ,1978
- Some theorems on the core of ann-Game without Side-PaymentsSIAM Journal on Applied Mathematics, 1970
- The Approximation of Fixed Points of a Continuous MappingSIAM Journal on Applied Mathematics, 1967
- A class of methods for solving nonlinear simultaneous equationsMathematics of Computation, 1965