Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Powell (1982)
Extensions to subroutine VFO2AD
N. Maratos (1978)
Exact penalty function algorithms for finite dimensional and control optimization problems
M. Powell (1978)
A fast algorithm for nonlinearly constrained optimization calculations
K. Schittkowski (1980)
Nonlinear programming codes
R. Chamberlain (1979)
Some examples of cycling in variable metric methods for constrained minimizationMathematical Programming, 16
R. Chamberlain, M. Powell, C. Lemaréchal, H. Pedersen (1982)
The watchdog technique for forcing convergence in algorithms for constrained optimization
A listing is given of a Fortran subroutine that calculates the least value of a function of several variables subject to general equality and inequality constraints. The user must provide an auxiliary subroutine that computes the objective and constraint functions and their gradients for any vector of variables. The underlying algorithm is a variable Metric method for Constrained optimization that includes the Watch-Dog technique, which gives the acronym VMCWD. This method is particularly efficient in terms of the number of function and gradient evaluations, but the overheads per iteration are expensive when the time to calculate functions and gradients is negligible.
ACM SIGMAP Bulletin – Association for Computing Machinery
Published: Apr 1, 1983
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.