Practical constraint \(K\)-segment principal curve algorithms for generating railway GPS digital map
From MaRDI portal
Publication:460363
DOI10.1155/2013/258694zbMath1296.90025OpenAlexW2076721696WikidataQ59025280 ScholiaQ59025280MaRDI QIDQ460363
Publication date: 13 October 2014
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/258694
Related Items (max. 100)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal properties of principal curves in the plane
- A strongly and superlinearly convergent SQP algorithm for optimization problems with linear complementarity constraints
- A k-segments algorithm for finding principal curves
- Principal Curves
- Parameter Selection for Principal Curves
- A trust region method based on interior point techniques for nonlinear programming.
This page was built for publication: Practical constraint \(K\)-segment principal curve algorithms for generating railway GPS digital map