Solving kinematics problems by efficient interval partitioning

DOI10.1007/s11081-010-9121-3zbMath1284.70008OpenAlexW2131921776MaRDI QIDQ2443368

Chandra Sekhar Pedamallu, Linet Özdamar

Publication date: 7 April 2014

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-010-9121-3

zbMATH Keywords

kinematicsconstraint satisfactionlocal search methodsbranch and bound techniqueinterval partitioning approaches

Mathematics Subject Classification ID

Computational methods for problems pertaining to mechanics of particles and systems (70-08) Kinematics of mechanisms and robots (70B15) Genetics and population dynamics (92D99)

Uses Software

• PROFIL/BIAS
• ICOS
• CFSQP
• ALIAS
• Numerica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms
• Computing all solutions to polynomial systems using homotopy continuation
• PROFIL/BIAS - A fast interval library
• Safe starting regions by fixed points and tightening
• Interval solution of nonlinear equations using linear programming
• A comparison of complete global optimization solvers
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• Interval Methods for Systems of Equations
• Solving Polynomial Systems Using a Branch and Prune Approach
• Applying interval arithmetic to real, integer, and boolean constraints
• An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
• Global Optimization and Constraint Satisfaction

This page was built for publication: Solving kinematics problems by efficient interval partitioning