An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)

DOI10.1016/0307-904X(83)90011-2MaRDI QIDQ799347zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 1983

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0307-904x(83)90011-2

zbMATH Keywords

optimizationconvergencecomparisonmathematical modelconjugate gradient algorithmleap-frogunconstrained minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• A convergent dynamic method for large minimization problems
• UNCONSTRAINED MINIMIZATION BY COMBINING THE DYNAMIC AND CONJUGATE GRADIENT METHODS
• The LFOPC leap-frog algorithm for constrained optimization
• A fast and robust unconstrained optimization method requiring minimum storage
• Differential optimization techniques

Cites work

• A convergent dynamic method for large minimization problems
• A new and dynamic method for unconstrained minimization

Cited in

(42)

• An iterative starting method to control parasitism for the Leapfrog method
• Differential optimization techniques
• Open-loop motion planning strategies for a vehicle towing three trailers
• Open loop strategies for the control of a disk rolling on a horizontal plane
• A convergent dynamic method for large minimization problems
• Computation of feasible command strategies for the navigation of a ship in a narrow zigzag channel
• A mathematical optimization methodology for the optimal design of a planar robotic manipulator
• The application of extended inverse dynamics control
• On the motion of a disc rolling on a horizontal plane: Path controllability and feedback control
• On a horizontal version of the inverse pendulum problem
• Computation of feasible command strategies for the navigation of a ship in a narrow zigzag channel
• A dynamic penalty function method for the solution of structural optimization problems
• A multi-start global minimization algorithm with dynamic search trajectories
• Optimal structural design of a planar parallel platform for machining
• Dynamic search trajectory methods for global optimization
• A trajectory-based method for constrained nonlinear optimization problems
• Optimisation of road vehicle passive suspension systems. I: Optimisation algorithm and vehicle model
• Collision avoidance by a ship with a moving obstacle: Computation of feasible command strategies
• Feasible command strategies for the control of motion of a simple mobile robot
• The dynamic-Q optimization method: an alternative to SQP?
• Global minimum cost design of a welded square stiffened plate supported at four corners
• A numerical method for the determination of dextrous workspaces of Gough-Stewart platforms
• Feasible command strategies for the control of a rolling disk with a rod fixed along its axis
• Using CFD and mathematical optimization to investigate air pollution due to stacks
• The influence of joint angle constraints on the optimum design of a planar robot manipulator following a complicated prescribed path
• The motion of a disk rolling on a vibrating horizontal plane: Feasible control and path controllability
• The motion of a cylinder-rod system on a horizontal plane: Feasible control and path controllability
• Using mathematical optimization in the CFD analysis of a continuous quenching process
• The chord method for the determination of nonconvex workspaces of planar parallel manipulators
• The design of discrete linear time-dependent stochastic control systems
• A numerical optimization procedure for complex pipe and duct network design
• UNCONSTRAINED MINIMIZATION BY COMBINING THE DYNAMIC AND CONJUGATE GRADIENT METHODS
• A reassessment of the Snyman-Fatti dynamic search trajectory method for unconstrained global optimization
• Computation of feasible control trajectories for the navigation of a ship around an obstacle in the presence of a sea current
• The LFOPC leap-frog algorithm for constrained optimization
• MinFinder v2.0: an improved version of minfinder
• An improved version of DYNAMIC-Q for simulation-based optimization using response surface gradients and an adaptive trust region
• A trajectory-based method for mixed integer nonlinear programming problems
• The determination of nonconvex workspaces of generally constrained planar Stewart platforms
• Investigation of the applicability of the dynamic-Q optimisation algorithm to vehicle suspension design
• Optimal design of a hoist structure frame
• Penalty function solutions to optimal control problems with general constraints via a dynamic optimisation method

This page was built for publication: An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)

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