# Changeset 510

Ignore:
Timestamp:
Aug 26, 2005 5:45:32 PM (15 years ago)
Message:

final touches to release as first official version 3.0.0 (to be copied to trunk)

Location:
branches/dev
Files:
18 edited

Unmodified
Removed
• ## branches/dev/AUTHORS

 r425 Main authors: - Andreas Waechter (IBM) - Carl Laird (IBM, CMU) Andreas Waechter, project leader (IBM) Carl Laird (IBM, Carnegie Mellon University) PDSystemImpl/PDFullSpace/IpTAUCSSolverInterface.hpp PDSystemImpl/PDFullSpace/IpTAUCSSolverInterface.cpp - Yoshiaki Kawajiri (Carnegie Mellon Univeristy): First version of Latex documentation file Docs/documentation.tex
• ## branches/dev/Algorithm/IpDefaultIterateInitializer.cpp

 r501 // Now we compute the initial values that the algorithm is going to // actually use.  We first store them in the trial fields in ip_data. // ToDo combine the following code with warm_start_intializer // Push the x iterates sufficiently inside the bounds
• ## branches/dev/Algorithm/IpFilter.hpp

 r501 DBG_ASSERT((Index)vals.size() == ncoor); // ToDo decide where we can get Compare_le from // ToDo decide if we need Compare_le bool retval = false; for (Index i=0; i
• ## branches/dev/Algorithm/IpFilterLineSearch.cpp

 r498 options.GetIntegerValue("watchdog_shortened_iter_trigger", watchdog_shortened_iter_trigger_, prefix); // ToDo decide if also the PDSystemSolver should be initialized here... rigorous_ = true; skipped_line_search_ = false;
• ## branches/dev/Algorithm/IpIpoptAlg.cpp

 r498 DBG_PRINT_VECTOR(2, "rhs", *rhs); //ToDo: allow us to delete entries in IpData to save memory? // To save memory, delete the old search directions //     IpData().SetFromPtr_delta_x(NULL); //     IpData().SetFromPtr_delta_s(NULL); //     IpData().SetFromPtr_delta_y_c(NULL); //     IpData().SetFromPtr_delta_y_d(NULL); //     IpData().SetFromPtr_delta_z_L(NULL); //     IpData().SetFromPtr_delta_z_U(NULL); //     IpData().SetFromPtr_delta_v_L(NULL); //     IpData().SetFromPtr_delta_v_U(NULL); // Get space for the search direction
• ## branches/dev/Algorithm/IpIpoptData.cpp

 r493 trial_ = NULL; // ToDo: Why don't we free the delta_ here? // Free the memory for the affine-scaling step delta_aff_ = NULL;
• ## branches/dev/Algorithm/IpMonotoneMuUpdate.hpp

 r501 const std::string& prefix); /** Method for determining the barrier parameter for the next iteration. *  When the optimality error for the current barrier parameter is less than *  a tolerance, the barrier parameter is reduced, and the Reset method of the *  LineSearch object linesearch is called. *  TODO: MORE DETAILS HERE */ /** Method for determining the barrier parameter for the next *  iteration.  When the optimality error for the current barrier *  parameter is less than a tolerance, the barrier parameter is *  reduced, and the Reset method of the LineSearch object *  linesearch is called. */ virtual void UpdateBarrierParameter();
• ## branches/dev/Algorithm/IpPDFullSpaceSolver.cpp

 r501 Index numberOfEVals=rhs.y_c()->Dim()+rhs.y_d()->Dim(); // counter for the number of trial evaluations // (ToDo is not at the corrent place) // (ToDo is not at the correct place) Index count = 0;
• ## branches/dev/Algorithm/IpWarmStartIterateInitializer.cpp

 r501 *IpNLP().Px_L(), *IpNLP().Px_U()); // ToDo: Don't see why this line is required //    IpData().SetTrialPrimalVariablesFromPtr(new_x, new_s); // Push the primal s variables
• ## branches/dev/Common/IpRegOptions.cpp

 r508 MakeValidLatexString(default_string_, buff); jnlst.Printf(J_SUMMARY, J_DOCUMENTATION, "\nThe default value for this string option is \"%s\".\n", buff.c_str()); "\nThe default value for this string option is \"%s\".\n", buff.c_str()); jnlst.Printf(J_SUMMARY, J_DOCUMENTATION, "\\\\ \nPossible values:\n");
• ## branches/dev/Common/IpSmartPtr.hpp

 r501 { public: // ToDo the following didn't work on AIX //static const Index dbg_smartptr_verbosity = 0; #define dbg_smartptr_verbosity 0
• ## branches/dev/Docs/documentation.tex

 r509 The initial version of this document was created by Yoshiaki Kawajir\footnote{Department of Chemical Engineering, Carnegie Mellon Univeristy, Pittsburgh PA} as a course project for Carnegie Mellon University, Pittsburgh PA} as a course project for \textit{47852 Open Source Software for Optimization}, taught by Prof. Fran\c cois Margot at Tepper School of Business, Carnegie Mellon University.  The current version is maintained by Carl Laird\footnote{Department of Chemical Engineering, Carnegie Mellon Univeristy, Pittsburgh PA} and Andreas University, Pittsburgh PA} and Andreas W\"achter\footnote{Department of Mathematical Sciences, IBM T.J.\ Watson Research Center, Yorktown Heights, NY}. \noindent The following names used in this document are trademarks or registered trademarks: AMPL, Intel, Miscrosoft, Visual Studio C++, Visual Studio trademarks: AMPL, Intel, Microsoft, Visual Studio C++, Visual Studio C++ .NET \end{small} \Ipopt\ distribution compile it automatically. \item A sparse symmetric indefinite linear solver. The \Ipopt\ needs to obtain the solution of sparse, symmtric, indefinite linear to obtain the solution of sparse, symmetric, indefinite linear systems, and for this it relies on third-party code.  Currently, your only option is the solver MA27 from the Harwell Subroutine Furthermore, we also make use a subroutine for scaling the linear systems arsing in \Ipopt, using the HSL routine MC19.  It is not systems arising in \Ipopt, using the HSL routine MC19.  It is not required to have MC19 to compile \Ipopt; if this routine is missing, the scaling is never performed. \subsection{Download External Code}\label{ExternalCode} \Ipopt\ uses a few external packages that are not included in the \Ipopt\ source code distribution, namely ASL (the Ampl Solver \Ipopt\ source code distribution, namely ASL (the AMPL Solver Library), BLAS, and some sparse linear algebra routines from the Harwell Subroutine Library. Note: Whereas currently obtaining MA27 is essential for using \Ipopt, MC19 could be omitted (with the consequence that you cannot use this method for scaling the linear systems arsing inside the \Ipopt\ method for scaling the linear systems arising inside the \Ipopt\ algorithm). basic steps that should work on most systems.  For special compilations and some for troubleshooting see Appendix~\ref{ExpertInstall} and consult the \Ipopt\ webpage before Appendix~\ref{ExpertInstall} and consult the \Ipopt\ homepage before submitting a ticket or sending a message to the mailing list. \begin{enumerate} There are two ways to install \Ipopt\ on Windows systems.  The first option, described in ection~\ref{CygwinInstall}, is to use Cygwin (see option, described in Section~\ref{CygwinInstall}, is to use Cygwin (see \texttt{www.cygwin.com}), which offers a UNIX-like environment on Windows and in which the installation procedure described earlier The boolean variable {\tt new\_x} will be false if the last call to any of the evaluation methods used the same $x$ values. This can be helpful when users have efficient implementations that caclulate helpful when users have efficient implementations that calculate multiple outputs at once. \Ipopt\ internally caches results from the {\tt TNLP} and generally, this flag can be ignored. The boolean variable {\tt new\_x} will be false if the last call to any of the evaluation methods used the same $x$ values. This can be helpful when users have efficient implementations that caclulate helpful when users have efficient implementations that calculate multiple outputs at once. \Ipopt\ internally caches results from the {\tt TNLP} and generally, this flag can be ignored. false if the last call to any of the evaluation methods used the same values. This can be helpful when users have efficient implementations that caclulate multiple outputs at once. \Ipopt\ internally caches that calculate multiple outputs at once. \Ipopt\ internally caches results from the {\tt TNLP} and generally, this flag can be ignored. pointer to a C structure; you should not access this structure directly, only through the functions provided in the C interface.} with the function {\tt CreateIpoptProblem}, which lateron has to be with the function {\tt CreateIpoptProblem}, which later has to be passed to the {\tt IpoptSolve} function. information between the main program that calls {\tt IpoptSolve} and any of the callback functions.  This pointer is simply passed unmodified by \Ipopt\ amoung those functions.  For example, you can unmodified by \Ipopt\ among those functions.  For example, you can use this to pass constants that define the optimization problem and are computed before the optimization in the main C program to the The last argument of the {\tt EV\_*} subroutines, {\tt IERR}, is to be set to 0 by the users on return, unless there was a problem during the evaluation of the optimnization problem during the evaluation of the optimization problem function/derivative for the given point {\tt X} (then it should return a non-zero value). Ipopt has many (maybe too many) options that can be adjusted for the algorithm.  Options are all identified by a string name and their values can be of one of three types, Number (real), Integer, or values can be of one of three types: Number (real), Integer, or String. Number options are used for things like tolerances, integer options are used for things like maximum number of iterations, and scaling method. Options can be set through code, through the AMPL interface if you are using AMPL, or by creating a {\tt PARAMS.DAT} file in the directory you are executing Ipopt. file in the directory you are executing \Ipopt. The {\tt PARAMS.DAT} file is read line by line and each line should # Set the max number of iterations max_iter 500 \end{verbatim} is a valid {\tt PARAMS.DAT} file. through AMPL, use the internal AMPL command {\tt options}.  For example, \\ {\tt options ipopt nlp\_scaling\_method=none mu\_init=1e-2 max\_iter=500''} \\ {\tt options ipopt "nlp\_scaling\_method=none mu\_init=1e-2 max\_iter=500"} \\ is a valid options command in AMPL. The most common options are referenced in Appendix~\ref{app.options_ref}. These are also \ref{app.options_ref}. You can print the documentation for all \Ipopt\ options by adding the option, \\ {\tt print\_options\_documentation yes} \\ and running \Ipopt\ (like the Ampl executable, for yes} \\ and running \Ipopt\ (like the AMPL executable, for instance). This will output all of the options documentation to the console. \item[{\tt inf\_pr}:] The scaled primal infeasibility at the current point. In restoration, this value is the primal infeasibility of the original problem at the current point. \item[{\tt inf\_du}:] The scaled dual infeasibility at the current point. In restoration, this is the value of the dual infeasibility for the restoration problem. \item[{\tt lg(mu)}:] The value of the barrier parameter mu ($log_{10}$). \item[{\tt lg(mu)}:] $\log_{10}$ of the value of the barrier parameter mu. \item[{\tt ||d||}:] The infinity norm (max) of the primal step (in x and s). In restoration, this value includes the values of the additional variables, $p$ and $n$. \item[{\tt lg(rg)}:] The value of the regularization term for the Hessian of the Lagrangian ($log_{10}$). \item[{\tt lg(rg)}:] $\log_{10}$ of the value of the regularization term for the Hessian of the Lagrangian in the augmented system. \item[{\tt alpha\_du}:] The stepsize for the dual variables. \item[{\tt alpha\_pr}:] The stepsize for the primal variables. \begin{description} \item[{\tt Solve\_Succeeded}:] $\;$ \\ Console Message: {\tt EXIT: Optimal Solution Found.} \\ This message indicates that \Ipopt\ found a (locally) optimal point within the desired tolerances. Console Message: {\tt EXIT: Optimal Solution Found.} \\ This message indicates that \Ipopt\ found a (locally) optimal point within the desired tolerances. \item[{\tt Solved\_To\_Acceptable\_Level}:]  $\;$ \\ Console Message: {\tt EXIT: Solved To Acceptable Level.} \\ This indicates that was not converged to the desired tolerances, but was converged to an acceptable level as specified by {\tt acceptable-*} options. This may happen if the desired tolerances are too small for the current problem. Console Message: {\tt EXIT: Solved To Acceptable Level.} \\ This indicates that was not converged to the desired tolerances, but was converged to an acceptable level as specified by {\tt acceptable-*} options. This may happen if the desired tolerances are too small for the current problem. \item[{\tt Infeasible\_Problem\_Detected}:]  $\;$ \\ Console Message: {\tt EXIT: Converged to a point of local infeasibility. Problem may be infeasible.} \\ The restoration phase converged to a point that was not feasible for the original problem. This indicates that the problem may be infeasible, or that the algorithm is stuck at a locally infeasible point. Console Message: {\tt EXIT: Converged to a point of local infeasibility. Problem may be infeasible.} \\ The restoration phase converged to a point that is a minimizer for the constraint violation (in the $\ell_1$-norm), but is not feasible for the original problem. This indicates that the problem may be infeasible (or at least that the algorithm is stuck at a locally infeasible point).  The returned point (the minimizer of the constraint violation) might help you to find which constraint is causing the problem.  If you believe that the NLP is feasible, it might help to start the optimization from a different point. \item[{\tt Search\_Direction\_Becomes\_Too\_Small}:]  $\;$ \\ Console Message: {\tt EXIT: Search Direction is becoming Too Small.} \\ This indicates that \Ipopt\ is calculating very small step sizes and making very little progress. This could happen if the problem has been solved to the best numerical accuracy possible given the current scaling. Console Message: {\tt EXIT: Search Direction is becoming Too Small.} \\ This indicates that \Ipopt\ is calculating very small step sizes and making very little progress.  This could happen if the problem has been solved to the best numerical accuracy possible given the current scaling. \item[{\tt Maximum\_Iterations\_Exceeded}:]  $\;$ \\ Console Message: {\tt EXIT: Maximum Number of Iterations Exceeded.} \\ This indicates that \Ipopt\ has exceeded the maximum number of iterations as specified by the option {\tt max\_iter}. Console Message: {\tt EXIT: Maximum Number of Iterations Exceeded.} \\ This indicates that \Ipopt\ has exceeded the maximum number of iterations as specified by the option {\tt max\_iter}. \item[{\tt Restoration\_Failed}:]  $\;$ \\ Console Message: {\tt EXIT: Restoration Failed!} \\ This indicates that the restoration phase failed to find a feasible point that was acceptable to the filter line search for the original problem. This could happen if the problem is highly degenerate or if your NLP provides incorrect derivative information. Console Message: {\tt EXIT: Restoration Failed!} \\ This indicates that the restoration phase failed to find a feasible point that was acceptable to the filter line search for the original problem. This could happen if the problem is highly degenerate or if your NLP provides incorrect derivative information. \item[{\tt Invalid\_Option}:]  $\;$ \\ Console Message: (details about the particular error will be output to the console) \\ This indicates that there was some problem specifying the options. See the specific message for details. Console Message: (details about the particular error will be output to the console) \\ This indicates that there was some problem specifying the options. See the specific message for details. \item[{\tt Not\_Enough\_Degrees\_Of\_Freedom}:]  $\;$ \\ Console Message: {\tt EXIT: Problem has too few degrees of freedom.} \\ This indicates that your problem, as specified, has too few degrees of freedom. This can happen if you have too many constraints, or if you fix too many variables (\Ipopt\ removes fixed variables). Console Message: {\tt EXIT: Problem has too few degrees of freedom.} \\ This indicates that your problem, as specified, has too few degrees of freedom. This can happen if you have too many equality constraints, or if you fix too many variables (\Ipopt\ removes fixed variables). \item[{\tt Invalid\_Problem\_Definition}:]  $\;$ \\ Console Message: (no console message, this is a return code for the C and Fortran interfaces only.) \\ This indicates that there was an exception of some sort when building the {\tt IpoptProblem} structure in the C or Fortran interface. Likely there is an error in your model or the {\tt main} routine. Console Message: (no console message, this is a return code for the C and Fortran interfaces only.) \\ This indicates that there was an exception of some sort when building the {\tt IpoptProblem} structure in the C or Fortran interface. Likely there is an error in your model or the {\tt main} routine. \item[{\tt Unrecoverable\_Exception}:]  $\;$ \\ Console Message: (details about the particular error will be output to the console) \\ This indicates that \Ipopt\ has thrown an exception that does not have an internal return code. See the specific message for details. Console Message: (details about the particular error will be output to the console) \\ This indicates that \Ipopt\ has thrown an exception that does not have an internal return code. See the specific message for details. \item[{\tt NonIpopt\_Exception\_Thrown}:]  $\;$ \\ Console Message: {\tt Unknown Exception caught in Ipopt} \\ An unknown exception was caught in Ipopt. This exception could have originated from your model or any linked in third party code. Console Message: {\tt Unknown Exception caught in Ipopt} \\ An unknown exception was caught in \Ipopt. This exception could have originated from your model or any linked in third party code. \item[{\tt Insufficient\_Memory}:]  $\;$ \\ Console Message: {\tt EXIT: Not enough memory.} \\ An error occurred while trying to allocate memory. The problem may be too large for your current memory and swap configuration. Console Message: {\tt EXIT: Not enough memory.} \\ An error occurred while trying to allocate memory. The problem may be too large for your current memory and swap configuration. \item[{\tt Internal\_Error}:]  $\;$ \\ Console Message: {\tt EXIT: INTERNAL ERROR: Unknown SolverReturn value - Notify IPOPT Authors.} \\ An unknown internal error has occurred. Please Notify the authors of \Ipopt. Console Message: {\tt EXIT: INTERNAL ERROR: Unknown SolverReturn value - Notify IPOPT Authors.} \\ An unknown internal error has occurred. Please notify the authors of \Ipopt. \end{description} \section{The Smart Pointer Implementation: {\tt SmartPtr}} \label{app.smart_ptr} The SmartPtr class is described in {\tt IpSmartPtr.hpp}. It is a The {\tt SmartPtr} class is described in {\tt IpSmartPtr.hpp}. It is a template class that takes care of deleting objects for us so we need not be concerned about memory leaks. Instead of pointing to an object with a raw C++ pointer (e.g. {\tt HS071\_NLP*}), we use a SmartPtr. Every time a SmartPtr is set to reference an object, it increments a counter in that object (see the ReferencedObject base class if you are interested). If a SmartPtr is done with the object, either by leaving scope or being set to point to another object, the counter is decremented. When the count of the object goes to zero, the object is automatically deleted. SmartPtr's are very simple, just use them as you would a standard pointer. It is very important to use SmartPtr's instead of raw pointers when passing objects to \Ipopt. Internally, \Ipopt\ uses smart pointers for referencing objects. If you use a raw pointer in your executable, the object's counter will NOT get incremented. Then, when \Ipopt\ uses smart pointers inside its own code, the counter will get with a raw C++ pointer (e.g. {\tt HS071\_NLP*}), we use a {\tt SmartPtr}.  Every time a {\tt SmartPtr} is set to reference an object, it increments a counter in that object (see the {\tt ReferencedObject} base class if you are interested). If a {\tt SmartPtr} is done with the object, either by leaving scope or being set to point to another object, the counter is decremented. When the count of the object goes to zero, the object is automatically deleted. {\tt SmartPtr}'s are very simple, just use them as you would a standard pointer. It is very important to use {\tt SmartPtr}'s instead of raw pointers when passing objects to \Ipopt. Internally, \Ipopt\ uses smart pointers for referencing objects. If you use a raw pointer in your executable, the object's counter will NOT get incremented. Then, when \Ipopt\ uses smart pointers inside its own code, the counter will get incremented. However, before \Ipopt\ returns control to your code, it will decrement as many times as it incremented and the counter will return to zero. Therefore, \Ipopt\ will delete the object. When control returns to you, you now have a raw pointer that points to a deleted object. return to zero. Therefore, \Ipopt\ will delete the object. When control returns to you, you now have a raw pointer that points to a deleted object. This might sound difficult to anyone not familiar with the use of \item Similarly, if you have a precompiled library containing the Harwell Subroutines, you can specify its location with the \verb|--with-hsl| flag. \verb|--with-hsl| flag.  And the location of the AMPL solver library (with the ASL header files) can be specified with \verb|--with-asldir|. \item If you want to specify that you want to use particular library {\tt libipopt.a} and the linker complains about missing symbols from C++ (e.g., the standard template library), you should specify the C++ libraries with the CXXLIBS variable.  To find out specify the C++ libraries with the {\tt CXXLIBS} variable.  To find out what those libraries are, it is probably helpful to link a C++ program with verbose compiler output. {\tt ./configure CC=icc F77=ifort CXX=icpc $\backslash$\\ \hspace*{14ex} CXXLIBS='-L/usr/lib/gcc-lib/i386-redhat-linux/3.2.3 -lstdc++'} \item Compilation in 64bit sometimes requires some espicial \item Compilation in 64bit sometimes requires some special consideration.  For example, for compilation of 64bit code on AIX, we recommend the following configuration the {\tt configure} variables {\tt AR}, {\tt ARFLAGS}, and {\tt AR\_X} are provided.  Here, {\tt AR} specifies the command for the archiver for creating an archive, and {\tt ARFLAGS} speficies additional flags.  {\tt AR\_X} contains the command for extracing archiver for creating an archive, and {\tt ARFLAGS} specifies additional flags.  {\tt AR\_X} contains the command for extracting all files from an archive.  For example, the default setting for SUN compilers for our configure script is debugging something. \item It is not necessary to produce the binary files in the directories where the source files are.  If you want to compile the code on different systems on a shared file system, you can keep one single copy of the source files in one directory, and the binary files for each configuration in separate directories.  For this, simply run the configure script in the directory where you want the base directory for the \Ipopt\ binary files.  For example: {\tt \$mkdir \$HOME/Ipopt-objects}\\ {\tt \$cd \$HOME/Ipopt-objects}\\ {\tt \$\$HOME/Ipopt/trunk/configure} \end{itemize}
• ## branches/dev/Docs/options.tex

 r508 $0 \le {\tt print\_level } \le 10$ and its default value is $3$. \paragraph{pivtol:} Pivot tolerance for the linear solver MA27. $\;$ \\ A smaller number pivots for sparsity, a larger number pivots for stability. The valid range for this real option is $0 < {\tt pivtol } < 1$ and its default value is $1 \cdot 10^{-08}$. \paragraph{pivtolmax:} Maximum pivot tolerance. $\;$ \\ Ipopt may increase pivtol as high as pivtolmax to get a more accurate solution to the linear system. The valid range for this real option is $0 < {\tt pivtolmax } < 1$ and its default value is $0.0001$. threshold. The valid range for this real option is $0 < {\tt constr\_viol\_tol } < {\tt +inf}$ and its default value is $0.0001$. \paragraph{pivtol:} Pivot tolerance for the linear solver MA27. $\;$ \\ A smaller number pivots for sparsity, a larger number pivots for stability. The valid range for this real option is $0 < {\tt pivtol } < 1$ and its default value is $1 \cdot 10^{-08}$. \paragraph{pivtolmax:} Maximum pivot tolerance. $\;$ \\ Ipopt may increase pivtol as high as pivtolmax to get a more accurate solution to the linear system. The valid range for this real option is $0 < {\tt pivtolmax } < 1$ and its default value is $0.0001$.
• ## branches/dev/Interfaces/IpIpoptApplication.cpp

 r508 std::list options_to_print; options_to_print.push_back("print_level"); options_to_print.push_back("pivtol"); options_to_print.push_back("pivtolmax"); options_to_print.push_back("tol"); options_to_print.push_back("compl_inf_tol"); options_to_print.push_back("constr_mult_init_max"); options_to_print.push_back("constr_viol_tol"); options_to_print.push_back("pivtol"); options_to_print.push_back("pivtolmax"); options_to_print.push_back("mu_strategy"); options_to_print.push_back("mu_init");
• ## branches/dev/Windows/VisualStudio_dotNET/include/config.h

 r475 /* Define to the full name and version of this package. */ #define PACKAGE_STRING "Ipopt 3.0.-1" #define PACKAGE_STRING "Ipopt 3.0.0" /* Define to the one symbol short name of this package. */ /* Define to the version of this package. */ #define PACKAGE_VERSION "3.0.-1" #define PACKAGE_VERSION "3.0.0" /* Define to 1 if you have the ANSI C header files. */ /* Version number of package */ #define VERSION "3.0.-1" #define VERSION "3.0.0"

 r507 #! /bin/sh # From configure.ac 3.0.-1. # From configure.ac 3.0.0. # Guess values for system-dependent variables and create Makefiles. # Generated by GNU Autoconf 2.59 for Ipopt 3.0.-1. # Generated by GNU Autoconf 2.59 for Ipopt 3.0.0. # # Report bugs to . PACKAGE_NAME='Ipopt' PACKAGE_TARNAME='ipopt' PACKAGE_VERSION='3.0.-1' PACKAGE_STRING='Ipopt 3.0.-1' PACKAGE_VERSION='3.0.0' PACKAGE_STRING='Ipopt 3.0.0' PACKAGE_BUGREPORT='coin-ipopt@www-124.ibm.com' # This message is too long to be a string in the A/UX 3.1 sh. cat <<_ACEOF \configure' configures Ipopt 3.0.-1 to adapt to many kinds of systems. \configure' configures Ipopt 3.0.0 to adapt to many kinds of systems. Usage: $0 [OPTION]... [VAR=VALUE]... if test -n "$ac_init_help"; then case $ac_init_help in short | recursive ) echo "Configuration of Ipopt 3.0.-1:";; short | recursive ) echo "Configuration of Ipopt 3.0.0:";; esac cat <<\_ACEOF if$ac_init_version; then cat <<\_ACEOF Ipopt configure 3.0.-1 Ipopt configure 3.0.0 generated by GNU Autoconf 2.59 running configure, to aid debugging if configure makes a mistake. It was created by Ipopt $as_me 3.0.-1, which was It was created by Ipopt$as_me 3.0.0, which was generated by GNU Autoconf 2.59.  Invocation command line was icpc | */icpc) ;; *) # ToDo decide aboiut unroll-loops # ToDo decide about unroll-loops opt_cxxflags="-O3" #        case $build in # Define the identity of the package. PACKAGE='ipopt' VERSION='3.0.-1' VERSION='3.0.0' cat >&5 <<_CSEOF This file was extended by Ipopt$as_me 3.0.-1, which was This file was extended by Ipopt $as_me 3.0.0, which was generated by GNU Autoconf 2.59. Invocation command line was cat >>$CONFIG_STATUS <<_ACEOF ac_cs_version="\\ Ipopt config.status 3.0.-1 Ipopt config.status 3.0.0 configured by $0, generated by GNU Autoconf 2.59, with options \\"echo "$ac_configure_args" | sed 's/[\\""\\$]/\\\\&/g'`\\" • ## branches/dev/configure.ac  r507 AC_PREREQ(2.59) AC_INIT([Ipopt],[3.0.-1],[coin-ipopt@www-124.ibm.com]) AC_INIT([Ipopt],[3.0.0],[coin-ipopt@www-124.ibm.com]) AC_COPYRIGHT([ under the Common Public License.]) AC_REVISION(3.0.-1) AC_REVISION(3.0.0) AC_CONFIG_SRCDIR(Common/IpDebug.hpp) icpc | */icpc) ;; *) # ToDo decide aboiut unroll-loops # ToDo decide about unroll-loops opt_cxxflags="-O3" # case$build in
Note: See TracChangeset for help on using the changeset viewer.