Modern homotopy methods in optimization
DOI10.1016/0045-7825(89)90053-4zbMath0693.65046OpenAlexW2039094757MaRDI QIDQ908661
Raphael T. Haftka, Layne T. Watson
Publication date: 1989
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: http://eprints.cs.vt.edu/archive/00000135/
algorithmsglobal convergencefinite elementsfinite differencescollocationunconstrained and constrained optimizationshootingBrouwer fixed point problemsengineering optimization problemspolynomial systems of equationsProbability-one homotopy methods
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10)
Related Items (26)
Uses Software
Cites Work
- CONKUB: A conversational path-follower for systems of nonlinear equations
- Tracing structural optima as a function of available resources by a homotopy method
- A globally convergent algorithm for computing fixed points of \(C^2\) maps
- A homotopy method applied to elastica problems
- Algorithm 652
- Numerical Linear Algebra Aspects of Globally Convergent Homotopy Methods
- The Expanded Lagrangian System for Constrained Optimization Problems
- Continuous Homotopies for the Linear Complementarity Problem
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- Computational experience with the Chow—Yorke algorithm
- 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
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
- Solving the Nonlinear Complementarity Problem by a Homotopy Method
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Modern homotopy methods in optimization