A variable rate refining triangulation
From MaRDI portal
Publication:3773705
DOI10.1007/BF02604640zbMath0634.90062MaRDI QIDQ3773705
Mark N. Broadie, B. Curtis Eaves
Publication date: 1987
Published in: Mathematical Programming (Search for Journal in Brave)
fixed pointslocal convergencevariable rate refive optimization problems of a special structure. As the corresponding problem of the lower level is always a parametric one theoretic results and solution procedures of parametric optimization
Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Fixed-point and coincidence theorems (topological aspects) (54H25)
Related Items
A continuous deformation algorithm for variational inequality problems on polytopes ⋮ The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations ⋮ \(D_ 3\)-triangulation for simplicial deformation algorithms for computing solutions of nonlinear equations
Cites Work
- A course in triangulations for solving equations with deformations
- A new subdivision for computing fixed points with a homotopy algorithm
- The octahedral algorithm, a new simplicial fixed point algorithm
- On triangulations for computing fixed points
- Improving the convergence of fixed-point algorithms
- Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
- Homotopies for computation of fixed points on unbounded regions