The dynamic-Q optimization method: an alternative to SQP?

DOI10.1016/S0898-1221(02)00281-XzbMATH Open1044.90078MaRDI QIDQ1416366FDOQ1416366

Authors A. M. Hay, Jan A. Snyman

Publication date 14 December 2003

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

programmingSuccessive approximationsConstrained optimizationSequential quadratic

Mathematics Subject Classification ID

Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 589245
• scientific article; zbMATH DE number 4167865
• scientific article; zbMATH DE number 1303280
• scientific article; zbMATH DE number 1932419
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization

Cites work

• A dynamic penalty function method for the solution of structural optimization problems
• A new and dynamic method for unconstrained minimization
• Algorithms for nonlinear constraints that use lagrangian functions
• An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
• Test examples for nonlinear programming codes
• The LFOPC leap-frog algorithm for constrained optimization
• The spherical quadratic steepest descent (SQSD) method for unconstrained minimization with no explicit line searches
• Using CFD and mathematical optimization to investigate air pollution due to stacks
• Using mathematical optimization in the CFD analysis of a continuous quenching process

Cited in

(16)

• Object library of algorithms for dynamic optimization problems: benchmarking SQP and nonlinear interior point methods
• A multi-level optimization methodology for determining the dextrous workspaces of planar parallel manipulators
• The new approach for dynamic optimization with variability constraints
• Optimal structural design of a planar parallel platform for machining
• Dynamic search trajectory methods for global optimization
• Dynamic response optimization using an active set RQP algorithm
• Gradient-only approaches to avoid spurious local minima in unconstrained optimization
• Approximated approximations for SAO
• The application of gradient-only optimization methods for problems discretized using non-constant methods
• Gradient-based approximation methods applied to the optimal design of vehicle suspension systems using computational models with severe inherent noise
• A quadratic approximation for structural topology optimization
• Efficient optimisation of a vehicle suspension system, using a gradient-based approximation method. I: mathematical modelling
• Efficient optimisation of a vehicle suspension system, using a gradient-based approximation method. II: optimisation results
• Incomplete series expansion for function approximation
• An improved version of DYNAMIC-Q for simulation-based optimization using response surface gradients and an adaptive trust region
• Investigation of the applicability of the dynamic-Q optimisation algorithm to vehicle suspension design

This page was built for publication: The dynamic-Q optimization method: an alternative to SQP?

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