Probability-one homotopies in computational science
DOI10.1016/S0377-0427(01)00473-3zbMath0996.65055MaRDI QIDQ1602815
Publication date: 24 June 2002
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
convergencepolynomial systemsnonlinear equationsnonlinear constrained optimizationBrouwer fixed point problemsHOMPACK 90mathematical software packagesPOLSYS\(_-\)PLPprobability-one homotopy algorithms
Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Packaged methods for numerical algorithms (65Y15)
Related Items (13)
Uses Software
Cites Work
- Modern homotopy methods in optimization
- Theory of Globally Convergent Probability-One Homotopies for Nonlinear Programming
- Algorithm 652
- Numerical Linear Algebra Aspects of Globally Convergent Homotopy Methods
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
- Algorithm 777: HOMPACK90
- Algorithm 801: POLSYS_PLP
- Unnamed Item
- Unnamed Item
This page was built for publication: Probability-one homotopies in computational science