Optimum dimensional synthesis of planar mechanisms with geometric constraints
From MaRDI portal
Publication:2121228
DOI10.1007/s11012-020-01250-xzbMath1483.70006OpenAlexW3093012503MaRDI QIDQ2121228
R. Ansola, I. Fernández de Bustos, V. García-Marina, G. Urkullu
Publication date: 1 April 2022
Published in: Meccanica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11012-020-01250-x
Numerical optimization and variational techniques (65K10) Kinematics of mechanisms and robots (70B15) Constrained dynamics, Dirac's theory of constraints (70H45)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Primal-dual subgradient methods for convex problems
- An evolutionary algorithm for path synthesis of mechanisms
- On adjustable spherical four-bar motion generation for expanded prescribed positions
- Dimensional synthesis of a spatial 3-RPS parallel manipulator for a prescribed range of motion of spherical joints
- Accuracy and stability of the null space method for solving the equality constrained least squares problem
- A null space method for solving system of equations.
- Optimal mechanism design using interior-point methods
- Dimensional synthesis of planar mechanisms using neural networks: application to path generator linkages
- Optimal synthesis of mechanisms with genetic algorithms
- A combined genetic algorithm--fuzzy logic method (GA--FL) in mechanisms synthesis
- Kinematics of coupler curves for spherical four-bar linkages based on new spherical adjoint approach
- A general procedure based on exact gradient determination in dimensional synthesis of planar mechanisms
- An efficient augmented Lagrangian method with applications to total variation minimization
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Approximate Synthesis of Spatial Linkages
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- An exact penalty function method with global convergence properties for nonlinear programming problems
- On the Convergence of a Sequential Penalty Function Method for Constrained Minimization
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Line Search Procedures for the Logarithmic Barrier Function
- A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function
- A Robust Null Space Method for Linear Equality Constrained State Estimation
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
