CONCON: A code for constrained minimization without derivative computation

Published: 01-01-1983| Version 1 | DOI: 10.17632/46kb8kdfgf.1
A. Buckley


Title of program: CONCON Catalogue Id: ACEM_v1_0 Nature of problem The problem is mathematical rather than physical, although the source of the mathematical problem can be any one of a number of fields of physics or engineering. The problem solved by CONCON is that of minimizing a nonlinear function f(x), where x may (but need not) be subject to a set of linear constraints of the form cTi(x)>bi, i=1,... ,m. Here x is a vector of n variables. Some of the constraints may be equalities or they may be simple bounds x1>0, which may be written as eTi(x) >0 to fit the ... Versions of this program held in the CPC repository in Mendeley Data ACEM_v1_0; CONCON; 10.1016/0010-4655(83)90003-6 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)