The LFOPC leap-frog algorithm for constrained optimization
- 1 October 2000
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 40 (8-9) , 1085-1096
- https://doi.org/10.1016/s0898-1221(00)85018-x
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The design of a planar robotic manipulator for optimum performance of prescribed tasksStructural and Multidisciplinary Optimization, 1999
- Optimum design of a three-dimensional serial robot manipulatorStructural and Multidisciplinary Optimization, 1999
- Using CFD and mathematical optimization to investigate air pollution due to stacksInternational Journal for Numerical Methods in Engineering, 1999
- A mathematical optimization methodology for the optimal design of a planar robotic manipulatorInternational Journal for Numerical Methods in Engineering, 1999
- Leap-frog is a robust algorithm for training neural networksNetwork: Computation in Neural Systems, 1999
- The influence of joint angle constraints on the optimum design of a planar robot manipulator following a complicated prescribed pathComputers & Mathematics with Applications, 1999
- A dynamic penalty function method for the solution of structural optimization problemsApplied Mathematical Modelling, 1994
- Penalty function solutions to optimal control problems with general constraints via a dynamic optimisation methodComputers & Mathematics with Applications, 1992
- An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)Applied Mathematical Modelling, 1983
- A new and dynamic method for unconstrained minimizationApplied Mathematical Modelling, 1982