scientific article; zbMATH DE number 3860299
[For the entire collection see Zbl 0533.00035.] This paper represents an introduction as well as a state of the art survey concerning homotopy methods for numerically approximating fixed points and zero-points of nonlinear mappings. Among the topics treated are: the construction of homotopies and conditions for attaining solutions; an outline of a predictor corrector algorithm for numerically tracing a homotopy path; an application to unconstrained optimization; an outline of a simplicial algorithm for tracing a homotopy path; and a simplicial algorithm using a refining triangulation. A bibliography with several hundred titles is included.
- A new predictor-corrector method for solving unconstrained minimization problems
- An efficient predictor-corrector method for solving nonlinear equations
- Numerical differentiation of implicitly defined space curves
- Stepsize selection in continuation procedures and damped Newton's method
- Fixed point theorems for discontinuous mapping
- Large sparse continuation problems
- An extended continuous Newton method
- A continuation algorithm for a class of linear complementarity problems using an extrapolation technique
- Secondary bifurcations in the buckling problem
- Universally converging adjustment processes -- a unifying approach.
- On parametric nonlinear programming
- A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games
- An implementation of the piecewise-linear homotopy algorithm for the computation of fixed points
- scientific article; zbMATH DE number 4192962 (Why is no real title available?)
- An analysis of the solution set to a homotopy equation between polynomials with real coefficients
- Critical sets in parametric optimization
- Bifurcation problems in nonlinear parametric programming
- scientific article; zbMATH DE number 69503 (Why is no real title available?)
- scientific article; zbMATH DE number 4121314 (Why is no real title available?)
- Solving nonlinear equation systems via global partition and search: Some experimental results
- Globally and universally convergent price adjustment processes
- Bifurcations in parametric nonlinear programming
- Mathematical foundations of nonsmooth embedding methods
- A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
- Finding special points using matrix-free predictor-corrector methods
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3327633)