A 'taut string algorithm' for straightening a piecewise linear path in two dimensions

DOI10.1093/imanum/18.1.1zbMath0908.65007OpenAlexW1983108588MaRDI QIDQ4399517

M. J. D. Powell

Publication date: 22 March 1999

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imanum/18.1.1

zbMATH Keywords

convergenceiterative algorithmnumerical examplesstraighteningminimization algorithmtaut-string algorithmpiecewise linear path

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (10)

A trivariate Powell-Sabin interpolant ⋮ A nonmonotone trust region method with adaptive radius for unconstrained optimization problems ⋮ Global convergence of a nonmonotone filter method for equality constrained optimization ⋮ A nonmonotone filter trust region method for nonlinear constrained optimization ⋮ A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values ⋮ Incorporating nonmonotone strategies into the trust region method for unconstrained optimization ⋮ A robust trust region method for nonlinear optimization with inequality constraint ⋮ Computation of nonautonomous invariant and inertial manifolds ⋮ A nonmonotone adaptive trust region method and its convergence ⋮ Contouring a bivariate quadratic polynomial over a triangle

This page was built for publication: A 'taut string algorithm' for straightening a piecewise linear path in two dimensions