Fix typos

Author: DimitriPapadopoulos

benchmark/rescue_idz/230406/fortran/common/powalg.f90

@@ -362,7 +362,7 @@ subroutine qrexc_Rdiag(A, Q, Rdiag, i)  ! Used in COBYLA
 ! After this is done for each K = 1, ..., N-1, we obtain the QR factorization of the matrix that
 ! rearranges columns [I, I+1, ..., N] of A as [I+1, ..., N, I].
 ! Powell's code, however, is slightly different: before everything, he first exchanged columns K and
-! K+1 of Q (as well as rows K and K+1 of R). This makes sure that the entires of the update RDIAG
+! K+1 of Q (as well as rows K and K+1 of R). This makes sure that the entries of the updated RDIAG
 ! are all positive if it is the case for the original RDIAG.
 do k = i, n-1_IK
     !hypt = hypotenuse(Rdiag(k+1), inprod(Q(:, k), A(:, k+1)))

benchmark/rescue_idz/230406/fortran/original/bobyqa/prelim.f

@@ -12,7 +12,7 @@ SUBROUTINE PRELIM (N,NPT,X,XL,XU,RHOBEG,IPRINT,MAXFUN,XBASE,
 C     GOPT is usually the gradient of the quadratic model at XOPT+XBASE, but
 C       it is set by PRELIM to the gradient of the quadratic model at XBASE.
 C       If XOPT is nonzero, BOBYQB will change it to its usual value later.
-C     NF is maintaned as the number of calls of CALFUN so far.
+C     NF is maintained as the number of calls of CALFUN so far.
 C     KOPT will be such that the least calculated value of F so far is at
 C       the point XPT(KOPT,.)+XBASE in the space of the variables.
 C

benchmark/rescue_idz/230406/fortran/original/newuoa/bigden.f

@@ -138,7 +138,7 @@ SUBROUTINE BIGDEN (N,NPT,XOPT,XPT,BMAT,ZMAT,IDZ,NDIM,KOPT,
       WVEC(IP,4)=ZERO
   120 WVEC(IP,5)=ZERO
 C
-C     Put the coefficents of THETA*Wcheck in PROD.
+C     Put the coefficients of THETA*Wcheck in PROD.
 C
       DO 190 JC=1,5
       NW=NPT

benchmark/rescue_idz/230406/matlab/interfaces/private/preprima.m

@@ -884,7 +884,7 @@
         wid = sprintf('%s:InvalidSolver', invoker);
         wmsg = sprintf('%s: a solver different from %s is specified; it is ignored.', invoker, invoker);
         % Do not display the value of solver in last message, because it
-        % can be 'unknow_solver'.
+        % can be 'unknown_solver'.
         warning(wid, '%s', wmsg);
         warnings = [warnings, wmsg];
     end

benchmark/rescue_idz/230406/norma/fortran/common/powalg.f90

@@ -358,7 +358,7 @@ subroutine qrexc_Rdiag(A, Q, Rdiag, i)  ! Used in COBYLA
 ! After this is done for each K = 1, ..., N-1, we obtain the QR factorization of the matrix that
 ! rearranges columns [I, I+1, ..., N] of A as [I+1, ..., N, I].
 ! Powell's code, however, is slightly different: before everything, he first exchanged columns K and
-! K+1 of Q (as well as rows K and K+1 of R). This makes sure that the entires of the update RDIAG
+! K+1 of Q (as well as rows K and K+1 of R). This makes sure that the entries of the updated RDIAG
 ! are all positive if it is the case for the original RDIAG.
 do k = i, n - 1_IK
     !hypt = hypotenuse(Rdiag(k + 1), inprod(Q(:, k), A(:, k + 1)))

benchmark/rescue_idz/230406/norma/fortran/original/bobyqa/prelim.f

@@ -12,7 +12,7 @@ SUBROUTINE PRELIM (N,NPT,X,XL,XU,RHOBEG,IPRINT,MAXFUN,XBASE,
 C     GOPT is usually the gradient of the quadratic model at XOPT+XBASE, but
 C       it is set by PRELIM to the gradient of the quadratic model at XBASE.
 C       If XOPT is nonzero, BOBYQB will change it to its usual value later.
-C     NF is maintaned as the number of calls of CALFUN so far.
+C     NF is maintained as the number of calls of CALFUN so far.
 C     KOPT will be such that the least calculated value of F so far is at
 C       the point XPT(KOPT,.)+XBASE in the space of the variables.
 C

benchmark/rescue_idz/230406/norma/fortran/original/newuoa/bigden.f

@@ -138,7 +138,7 @@ SUBROUTINE BIGDEN (N,NPT,XOPT,XPT,BMAT,ZMAT,IDZ,NDIM,KOPT,
       WVEC(IP,4)=ZERO
   120 WVEC(IP,5)=ZERO
 C
-C     Put the coefficents of THETA*Wcheck in PROD.
+C     Put the coefficients of THETA*Wcheck in PROD.
 C
       DO 190 JC=1,5
       NW=NPT

benchmark/rescue_idz/230406/norma/matlab/interfaces/private/preprima_norma.m

@@ -884,7 +884,7 @@
         wid = sprintf('%s:InvalidSolver', invoker);
         wmsg = sprintf('%s: a solver different from %s is specified; it is ignored.', invoker, invoker);
         % Do not display the value of solver in last message, because it
-        % can be 'unknow_solver'.
+        % can be 'unknown_solver'.
         warning(wid, '%s', wmsg);
         warnings = [warnings, wmsg];
     end

fortran/common/powalg.f90

@@ -364,7 +364,7 @@ subroutine qrexc_Rdiag(A, Q, Rdiag, i)  ! Used in COBYLA
 ! After this is done for each K = 1, ..., N-1, we obtain the QR factorization of the matrix that
 ! rearranges columns [I, I+1, ..., N] of A as [I+1, ..., N, I].
 ! Powell's code, however, is slightly different: before everything, he first exchanged columns K and
-! K+1 of Q (as well as rows K and K+1 of R). This makes sure that the entires of the update RDIAG
+! K+1 of Q (as well as rows K and K+1 of R). This makes sure that the entries of the updated RDIAG
 ! are all positive if it is the case for the original RDIAG.
 ! Zaikun 20230903: It turns out that Powell's code does not ensure that the original RDIAG is
 ! positive (see QRADD_RDIAG), and hence the updated RDIAG may contain negative values.

fortran/original/bobyqa/prelim.f

@@ -12,7 +12,7 @@ SUBROUTINE PRELIM (N,NPT,X,XL,XU,RHOBEG,IPRINT,MAXFUN,XBASE,
 C     GOPT is usually the gradient of the quadratic model at XOPT+XBASE, but
 C       it is set by PRELIM to the gradient of the quadratic model at XBASE.
 C       If XOPT is nonzero, BOBYQB will change it to its usual value later.
-C     NF is maintaned as the number of calls of CALFUN so far.
+C     NF is maintained as the number of calls of CALFUN so far.
 C     KOPT will be such that the least calculated value of F so far is at
 C       the point XPT(KOPT,.)+XBASE in the space of the variables.
 C