The dynamic-Q optimization method: an alternative to SQP?
type: Item
instance of: scholarly article
title: The dynamic-Q optimization method: an alternative to SQP?
zbMATH Open document ID: 1044.90078
DOI: 10.1016/S0898-1221(02)00281-X
author: A. M. Hay
author: Jan A. Snyman
publication date: 2003-12-14T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C55
zbMATH DE Number: 2017170
zbMATH Keywords: Constrained optimization
zbMATH Keywords: Successive approximations
zbMATH Keywords: Sequential quadratic
zbMATH Keywords: programming
MaRDI profile type: Publication
cites work: The spherical quadratic steepest descent (SQSD) method for unconstrained minimization with no explicit line searches
cites work: Algorithms for nonlinear constraints that use lagrangian functions
cites work: A dynamic penalty function method for the solution of structural optimization problems
cites work: A new and dynamic method for unconstrained minimization
cites work: An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
cites work: The LFOPC leap-frog algorithm for constrained optimization
cites work: Test examples for nonlinear programming codes
cites work: Using CFD and mathematical optimization to investigate air pollution due to stacks
cites work: Using mathematical optimization in the CFD analysis of a continuous quenching process
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 2017170