๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The LFOPC leap-frog algorithm for constrained optimization

โœ Scribed by J.A. Snyman

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
619 KB
Volume
40
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

โœฆ Synopsis

AbstractwThis paper describes an accurate and reliable new algorithm (LFOPC) for solving constrained optimization problems, through a three-phase application of the well-established leap-frog method for unconstrained optimization, to penalty function formulations of the original constrained problems. The algorithm represents a considerable improvement over an earlier version (LFOPCON) which requires the judicious choice of parameter settings for efficient use. The current algorithm automatically executes normalization and scaling operations on the gradients of the constraints. This results in a robust algorithm that, apart from convergence tolerances, requires virtually no parameter settings. The method has been well tested, on both standard analytical test problems and practical engineering design problems. (~) 2000 Elsevier Science Ltd. All rights reserved.

๐Ÿ“œ SIMILAR VOLUMES

Algorithms for PDE-constrained optimizat
Algorithms for PDE-constrained optimization
โœ Roland Herzog; Karl Kunisch ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 166 KB

Some first and second order algorithmic approaches for the solution of PDE-constrained optimization problems are reviewed. An optimal control problem for the stationary Navier-Stokes system with pointwise control constraints serves as an illustrative example. Some issues in treating inequality const

Optimal Algorithms for Constrained Recon
Optimal Algorithms for Constrained Reconfigurable Meshes
โœ Bryan Beresford-Smith; Oliver Diessel; Hossam ElGindy ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 220 KB

model the propagation delay on a bus-unit 1 by a constant, and to only permit the class of algorithms, denoted by A k , which configure bus components bound in size to at most k bus-units to run on the model. We give a detailed description of our reconfigurable mesh model in the following section.