A modification of the BB method for box-constrained optimization and an application to inverse kinematics
From MaRDI portal
Publication:285928
Recommendations
- A convex programming approach to the inverse kinematics problem for manipulators under constraints
- A MOLECULAR INVERSE KINEMATICS PROBLEM: AN APPROXIMATION APPROACH AND CHALLENGES
- An affine-scaling interior-point CBB method for box-constrained optimization
- A constrained generalised-\(\alpha\) method for coupling rigid parallel chain kinematics and elastic bodies
- Design of inverse kinematics algorithms: extended jacobian approximation of the dynamically consistent Jacobian inverse
- Approximation of Jacobian inverse kinematics algorithms: differential geometric vs. Variational approach
- scientific article; zbMATH DE number 1304579
- A new systematic method for efficiently solving holonomic (and nonholonomic) constraint problems
- Two optimization algorithms for solving robotics inverse kinematics with redundancy
- Approximation of Jacobian inverse kinematics algorithms
Cites work
- scientific article; zbMATH DE number 2035082 (Why is no real title available?)
- scientific article; zbMATH DE number 3002670 (Why is no real title available?)
- scientific article; zbMATH DE number 3445928 (Why is no real title available?)
- scientific article; zbMATH DE number 761488 (Why is no real title available?)
- scientific article; zbMATH DE number 815479 (Why is no real title available?)
- scientific article; zbMATH DE number 1440908 (Why is no real title available?)
- A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- A posteriori direction selection rules for interval optimization methods
- A remark on the GOP algorithm for global optimization
- Bounds on real eigenvalues and singular values of interval matrices
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- Deterministic global optimization. Theory, methods and applications
- Efficient Calculation of Bounds on Spectra of Hessian Matrices
- Efficient computation of spectral bounds for Hessian matrices on hyperrectangles for global optimization
- Fast calculation of spectral bounds for Hessian matrices on hyperrectangles
- Finding all solutions of nonlinearly constrained systems of equations
- Global minimum potential energy conformations of small molecules
- Global optimization using interval analysis - the multi-dimensional case
- Introduction to Interval Analysis
- Jointly Constrained Biconvex Programming
- New methods for calculating \(\alpha\)BB-type underestimators
- On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method
- Positive Definiteness and Stability of Interval Matrices
- Subdivision Direction Selection in Interval Methods for Global Optimization
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
Cited in
(3)
This page was built for publication: A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285928)
