A new and dynamic method for unconstrained minimization
From MaRDI portal
Publication:1172368
DOI10.1016/S0307-904X(82)80007-3zbMath0501.65026OpenAlexW1966612784MaRDI QIDQ1172368
Publication date: 1982
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0307-904x(82)80007-3
algorithmunconstrained minimizationgradient methodquasi-Newton methodsdynamic methodmotion of the particle
Related Items
A multi-start global minimization algorithm with dynamic search trajectories ⋮ The chord method for the determination of nonconvex workspaces of planar parallel manipulators ⋮ A dynamic penalty function method for the solution of structural optimization problems ⋮ Open-loop motion planning strategies for a vehicle towing three trailers ⋮ UNCONSTRAINED MINIMIZATION BY COMBINING THE DYNAMIC AND CONJUGATE GRADIENT METHODS ⋮ Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations ⋮ On a horizontal version of the inverse pendulum problem ⋮ The motion of a disk rolling on a vibrating horizontal plane: Feasible control and path controllability ⋮ Investigation of the applicability of the dynamic-Q optimisation algorithm to vehicle suspension design ⋮ The motion of a cylinder-rod system on a horizontal plane: Feasible control and path controllability ⋮ Collision avoidance by a ship with a moving obstacle: Computation of feasible command strategies ⋮ A convergent dynamic method for large minimization problems ⋮ Feasible command strategies for the control of a rolling disk with a rod fixed along its axis ⋮ Using mathematical optimization in the CFD analysis of a continuous quenching process ⋮ Global minimum cost design of a welded square stiffened plate supported at four corners ⋮ The application of gradient-only optimization methods for problems discretized using non-constant methods ⋮ A numerical optimization procedure for complex pipe and duct network design ⋮ A trajectory-based method for mixed integer nonlinear programming problems ⋮ The dynamic-Q optimization method: an alternative to SQP? ⋮ The influence of joint angle constraints on the optimum design of a planar robot manipulator following a complicated prescribed path ⋮ 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 ⋮ Penalty function solutions to optimal control problems with general constraints via a dynamic optimisation method ⋮ A numerical method for the determination of dextrous workspaces of Gough–Stewart platforms ⋮ A new descent algorithm with curve search rule ⋮ On memory gradient method with trust region for unconstrained optimization ⋮ Computation of feasible command strategies for the navigation of a ship in a narrow zigzag channel ⋮ A trajectory-based method for constrained nonlinear optimization problems ⋮ Computation of feasible command strategies for the navigation of a ship in a narrow zigzag channel ⋮ Dynamic search trajectory methods for global optimization ⋮ Computation of feasible control trajectories for the navigation of a ship around an obstacle in the presence of a sea current ⋮ Using CFD and mathematical optimization to investigate air pollution due to stacks ⋮ A mathematical optimization methodology for the optimal design of a planar robotic manipulator ⋮ An improved version of DYNAMIC-Q for simulation-based optimization using response surface gradients and an adaptive trust region ⋮ Differential optimization techniques ⋮ A reassessment of the Snyman-Fatti dynamic search trajectory method for unconstrained global optimization ⋮ Open loop strategies for the control of a disk rolling on a horizontal plane ⋮ Feasible command strategies for the control of motion of a simple mobile robot ⋮ The application of extended inverse dynamics control ⋮ A new super-memory gradient method with curve search rule ⋮ The LFOPC leap-frog algorithm for constrained optimization ⋮ The determination of nonconvex workspaces of generally constrained planar Stewart platforms ⋮ An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b) ⋮ Note on global convergence of ODE methods for unconstrained optimization
Cites Work
