Solving kinematics problems by efficient interval partitioning

DOI10.1007/S11081-010-9121-3MaRDI QIDQ2443368zbMATH OpenOpenAlexFDO

Authors 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

branch and bound techniqueconstraint satisfactioninterval partitioning approacheskinematicslocal search methods

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)

Recommendations

• A symbolic-interval inference approach for constraint satisfaction: implementation on kinematics applications
• A Collaborative Solution Methodology for Inverse Position Problem
• Efficient interval partitioning-local search collaboration for constraint satisfaction
• scientific article; zbMATH DE number 5370186
• Fast algebraic methods for interval constraint problems

Cites work

• A comparison of complete global optimization solvers
• An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
• Applying interval arithmetic to real, integer, and boolean constraints
• Benchmarking global optimization and constraint satisfaction codes
• Computing all solutions to polynomial systems using homotopy continuation
• scientific article; zbMATH DE number 1304541 (Why is no real title available?)
• scientific article; zbMATH DE number 1304579 (Why is no real title available?)
• scientific article; zbMATH DE number 757686 (Why is no real title available?)
• Interval Methods for Systems of Equations
• Interval solution of nonlinear equations using linear programming
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• PROFIL/BIAS - A fast interval library
• Safe starting regions by fixed points and tightening
• Solving Polynomial Systems Using a Branch and Prune Approach
• Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms

Cited in

(2)

• Efficient interval partitioning-local search collaboration for constraint satisfaction
• A Collaborative Solution Methodology for Inverse Position Problem

Describes a project that uses

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2443368)