The LFOPC leap-frog algorithm for constrained optimization
From MaRDI portal
Publication:1591934
DOI10.1016/S0898-1221(00)85018-XzbMath1016.90055WikidataQ126635369 ScholiaQ126635369MaRDI QIDQ1591934
Publication date: 14 January 2001
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (16)
On the robustness of a simple domain reduction scheme for simulation‐based optimization ⋮ Optimization of heat sink mass using the DYNAMIC-Q numerical optimization method ⋮ The chord method for the determination of nonconvex workspaces of planar parallel manipulators ⋮ A spectral Rayleigh-Ritz scheme for nonlinear partial differential systems of first order ⋮ Investigation of the applicability of the dynamic-Q optimisation algorithm to vehicle suspension design ⋮ The dynamic-Q optimization method: an alternative to SQP? ⋮ Optimal structural design of a planar parallel platform for machining ⋮ Optimal design of a hoist structure frame ⋮ Optimisation of road vehicle passive suspension systems. I: Optimisation algorithm and vehicle model ⋮ Optimisation of road vehicle passive suspension systems. II: Qualification and case study ⋮ Gradient-based approximation methods applied to the optimal design of vehicle suspension systems using computational models with severe inherent noise ⋮ Automotive crashworthiness design using response surface‐based variable screening and optimization ⋮ A numerical method for the determination of dextrous workspaces of Gough–Stewart platforms ⋮ Efficient optimisation of a vehicle suspension system, using a gradient-based approximation method. I: mathematical modelling ⋮ An improved version of DYNAMIC-Q for simulation-based optimization using response surface gradients and an adaptive trust region ⋮ The determination of nonconvex workspaces of generally constrained planar Stewart platforms
Cites Work
- Unnamed Item
- An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
- Test examples for nonlinear programming codes
- A new and dynamic method for unconstrained minimization
- Penalty function solutions to optimal control problems with general constraints via a dynamic optimisation method
- A dynamic penalty function method for the solution of structural optimization problems
- The influence of joint angle constraints on the optimum design of a planar robot manipulator following a complicated prescribed path
- Leap-frog is a robust algorithm for training neural networks
- A mathematical optimization methodology for the optimal design of a planar robotic manipulator
- Using CFD and mathematical optimization to investigate air pollution due to stacks
- Using mathematical optimization in the CFD analysis of a continuous quenching process
This page was built for publication: The LFOPC leap-frog algorithm for constrained optimization
