CONMIN: A FORTRAN program for constrained function minimization: User's manual

  • Vanderplaats G
N/ACitations
Citations of this article
32Readers
Mendeley users who have this article in their library.

Abstract

CONMIN is a FORTRAN program, in subroutine form, for the solution of linear or nonlinear constrained optimization problems. The basic optimization algorithm is the Method of Feasible Directions. The user must provide a main calling program and an external routine to evaluate the objective and constraint functions and to provide gradient information. If analytic gradients of the objective or constraint functions are not available, this information is calculated by finite difference. While the program is intended primarily for efficient solution of constrained problems, unconstrained function minimization problems may also be solved, and the conjugate direction method of Fletcher and Reeves is used for this purpose. This manual describes the use of CONMIN and defines all necessary parameters. Sufficient information is provided so that the program can be used without special knowledge of optimization techniques. Sample problems are included to help the user become familiar with CONMIN and to make the program operational.

Cite

CITATION STYLE

APA

Vanderplaats, G. (1973). CONMIN: A FORTRAN program for constrained function minimization: User’s manual (p. 61). Moffett Field, CA. Retrieved from http://ntrs.nasa.gov/search.jsp?R=19730017892

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free