24#if defined(_WIN32) && !defined(_WIN64)
25#define dec_directives_win32
34 Integer,
save :: seed = 12359
36 seed = mod(seed*1027+25,1048576)
37 rndx = float(seed)/float(1048576)
49 real*8,
Parameter :: xtarg = -1.0
50 real*8,
Parameter :: noise = 1.0
51 Real,
External :: Rndx
59 o = o + a(i,j) * xtarg + b(i,j) * xtarg**2
61 obs(i) = o + noise * rndx()
88#ifdef dec_directives_win32
101 INTEGER,
Dimension(:),
Pointer :: cntvect
122 coi_error = max( coi_error,
coidef_optfile( cntvect,
'leastsq10.opt' ) )
136#if defined(CONOPT_LICENSE_INT_1) && defined(CONOPT_LICENSE_INT_2) && defined(CONOPT_LICENSE_INT_3) && defined(CONOPT_LICENSE_TEXT)
137 coi_error = max( coi_error,
coidef_license( cntvect, conopt_license_int_1, conopt_license_int_2, conopt_license_int_3, conopt_license_text) )
140 If ( coi_error .ne. 0 )
THEN
142 write(*,*)
'**** Fatal Error while loading CONOPT Callback routines.'
144 call flog(
"Skipping Solve due to setup errors", 1 )
152 write(*,*)
'End of Least Square example 10. Return code=',coi_error
154 If ( coi_error /= 0 )
then
155 call flog(
"Errors encountered during solution", 1 )
157 call flog(
"Status or Solution routine was not called", 1 )
159 call flog(
"Solver and Model Status was not as expected (1,2)", 1 )
160 elseif ( abs(
obj - 19.44434311d0 ) > 1.d-7 )
then
161 call flog(
"Incorrect objective returned", 1 )
164 if (
coi_free(cntvect) /= 0 )
call flog(
"Error while freeing control vector",1)
166 call flog(
"Successful Solve", 0 )
177Integer Function lsq_readmatrix( lower, curr, upper, vsta, type, rhs, esta, &
178 colsta, rowno, value, nlflag, n, m, nz, &
180#ifdef dec_directives_win32
185 integer,
intent (in) :: n
186 integer,
intent (in) :: m
187 integer,
intent (in) :: nz
188 real*8,
intent (in out),
dimension(n) :: lower
189 real*8,
intent (in out),
dimension(n) :: curr
190 real*8,
intent (in out),
dimension(n) :: upper
191 integer,
intent (in out),
dimension(n) :: vsta
193 integer,
intent (out),
dimension(m) ::
type
194 integer,
intent (in out),
dimension(m) :: esta
196 real*8,
intent (in out),
dimension(m) :: rhs
197 integer,
intent (in out),
dimension(n+1) :: colsta
198 integer,
intent (out),
dimension(nz) :: rowno
199 integer,
intent (in out),
dimension(nz) :: nlflag
200 real*8,
intent (in out),
dimension(nz) ::
value
285Integer Recursive function
lsq_fdeval( x, g, jac, rowno, jcnm, mode, ignerr, errcnt, &
286 n, nz, thread, usrmem )
287#ifdef dec_directives_win32
292 integer,
intent (in) :: n
293 integer,
intent (in) :: rowno
294 integer,
intent (in) :: nz
295 real*8,
intent (in),
dimension(n) :: x
296 real*8,
intent (in out) :: g
297 real*8,
intent (in out),
dimension(n) :: jac
298 integer,
intent (in),
dimension(nz) :: jcnm
300 integer,
intent (in) :: mode
302 integer,
intent (in) :: ignerr
304 integer,
intent (in out) :: errcnt
306 integer,
intent (in) :: thread
314 if ( rowno .eq.
nobs+1 )
then
318 if ( mode .eq. 1 .or. mode .eq. 3 )
then
328 if ( mode .eq. 2 .or. mode .eq. 3 )
then
340 if ( mode .eq. 1 .or. mode .eq. 3 )
then
343 s = s + a(rowno,j)*x(j) + b(rowno,j)*x(j)**2
350 if ( mode .eq. 2 .or. mode .eq. 3 )
then
352 jac(j) = a(rowno,j) + 2.d0*b(rowno,j)*x(j)
364Integer Function lsq_2ddir( X, DX, D2G, ROWNO, JCNM, NODRV, N, NJ, THREAD, USRMEM )
365#ifdef dec_directives_win32
370 INTEGER,
Intent(IN) :: rowno, n,
nj, thread
371 INTEGER,
Intent(IN OUT) :: nodrv
372 INTEGER,
Dimension(NJ),
Intent(IN) :: jcnm
373 real*8,
Dimension(N),
Intent(IN) :: x
374 real*8,
Dimension(N),
Intent(IN) :: dx
375 real*8,
Dimension(N),
Intent(OUT) :: d2g
376 real*8,
Intent(IN OUT) :: usrmem(*)
379 if ( rowno .eq.
nobs+1 )
then
413Integer Function lsq_2ddirini( X, DX, RowList, ListSize, NumThread, NewPT, NODRV, NumVar, USRMEM )
414#ifdef dec_directives_win32
419 INTEGER,
Intent(IN) :: listsize, numthread, newpt, numvar
420 Integer,
Intent(IN OUT) :: nodrv
421 real*8,
Dimension(NumVar),
Intent(IN) :: x
422 real*8,
Dimension(NumVar),
Intent(IN) :: dx
423 Integer,
Dimension(ListSize),
Intent(IN) :: rowlist
424 real*8,
Intent(IN OUT) :: usrmem(*)
433 write(10,*)
'Inside 2DDirIni: NewPt=',newpt
436 c(i,j) = 2.d0*b(i,j)*dx(j)
integer function std_solution(xval, xmar, xbas, xsta, yval, ymar, ybas, ysta, n, m, usrmem)
integer function std_status(modsta, solsta, iter, objval, usrmem)
integer function std_message(smsg, dmsg, nmsg, llen, usrmem, msgv)
integer function std_errmsg(rowno, colno, posno, msglen, usrmem, msg)
integer(c_int) function coidef_message(cntvect, coi_message)
define callback routine for handling messages returned during the solution process.
integer(c_int) function coidef_solution(cntvect, coi_solution)
define callback routine for returning the final solution values.
integer(c_int) function coidef_status(cntvect, coi_status)
define callback routine for returning the completion status.
integer(c_int) function coidef_readmatrix(cntvect, coi_readmatrix)
define callback routine for providing the matrix data to CONOPT.
integer(c_int) function coidef_errmsg(cntvect, coi_errmsg)
define callback routine for returning error messages for row, column or Jacobian elements.
integer(c_int) function coidef_fdeval(cntvect, coi_fdeval)
define callback routine for performing function and derivative evaluations.
integer(c_int) function coidef_2ddirini(cntvect, coi_2ddirini)
define callback routine for initializing the computation of second derivatives for a constraint in a ...
integer(c_int) function coidef_optfile(cntvect, optfile)
define callback routine for defining an options file.
integer(c_int) function coidef_2ddir(cntvect, coi_2ddir)
define callback routine for computing the second derivative for a constraint in a direction.
integer(c_int) function coidef_license(cntvect, licint1, licint2, licint3, licstring)
define the License Information.
integer(c_int) function coidef_debugfv(cntvect, debugfv)
turn Debugging of FDEval on and off.
integer(c_int) function coidef_numvar(cntvect, numvar)
defines the number of variables in the model.
integer(c_int) function coidef_numcon(cntvect, numcon)
defines the number of constraints in the model.
integer(c_int) function coidef_numnlnz(cntvect, numnlnz)
defines the Number of Nonlinear Nonzeros.
integer(c_int) function coidef_optdir(cntvect, optdir)
defines the Optimization Direction.
integer(c_int) function coidef_numnz(cntvect, numnz)
defines the number of nonzero elements in the Jacobian.
integer(c_int) function coidef_objcon(cntvect, objcon)
defines the Objective Constraint.
integer(c_int) function coi_create(cntvect)
initializes CONOPT and creates the control vector.
integer(c_int) function coi_free(cntvect)
frees the control vector.
integer(c_int) function coi_solve(cntvect)
method for starting the solving process of CONOPT.
integer function lsq_readmatrix(lower, curr, upper, vsta, type, rhs, esta, colsta, rowno, value, nlflag, n, m, nz, usrmem)
Define information about the model.
integer function lsq_fdeval(x, g, jac, rowno, jcnm, mode, ignerr, errcnt, n, nz, thread, usrmem)
Compute nonlinear terms and non-constant Jacobian elements.
integer function lsq_2ddirini(x, dx, rowlist, listsize, numthread, newpt, nodrv, numvar, usrmem)
Computes the second derivative of a constraint in a direction.
integer function lsq_2ddir(x, dx, d2g, rowno, jcnm, nodrv, n, nj, thread, usrmem)
Computes the second derivative of a constraint in a direction.
void defdata()
Defines the data for the problem.
float rndx()
Defines a pseudo random number between 0 and 1.
program leastsquare
Main program. A simple setup and call of CONOPT.
subroutine flog(msg, code)