Release0.6 (#442)

* updated user manual added Frank as "author" to the user manual * up'ed VERSION * updated CHANGELOG.md
LLNL · Mar 31, 2022 · 21af7eb · 21af7eb
1 parent ba0fb3b
commit 21af7eb
Show file tree

Hide file tree

Showing 4 changed files with 16 additions and 6 deletions.
diff --git a/CHANGELOG.md b/CHANGELOG.md
@@ -1,6 +1,16 @@
 # Change Log
 All notable changes to HiOp will be documented in this file.
 
+## Version 0.6.0: Release of the PriDec optimization and improved GPU computations (March 31, 2022)
+The salient features of v0.6.0 are 
+
+- the release of the primal decomposition (PriDec) solver for structured two-stage problems 
+- improved support for (NVIDIA) GPUs for solving sparse optimization problems via NVIDIA's cuSOLVER API and newly developed condensed optimization kernels.
+
+Other notable capabilities include
+ - improved accuracy in the computations of the search directions via Krylov-based iterative refinement
+ - design of a matrix interface for sparse matrices in compressed sparse row format and (capable) CPU reference implementation
+
 ## Version 0.5.4: Elastic mode, Krylov solvers, and misc bug fixes (March 2, 2022)
 New algorithmic features related to the NLP solver(s) and associated linear algebra KKT systems
 

diff --git a/CMakeLists.txt b/CMakeLists.txt
@@ -11,7 +11,7 @@ if (POLICY CMP0074)
   cmake_policy(SET CMP0074 NEW)
 endif ()
 
-project (hiop VERSION "0.5.0")
+project (hiop VERSION "0.6.0")
 
 string(TIMESTAMP HIOP_RELEASE_DATE "%Y-%m-%d")
 

diff --git a/doc/hiop_usermanual.pdf b/doc/hiop_usermanual.pdf
diff --git a/doc/src/techrep_main.tex b/doc/src/techrep_main.tex
@@ -132,15 +132,15 @@
 \vspace{3cm}
 
   {\huge\bfseries \Hi\ -- User Guide} \\[14pt]
-  {\large\bfseries version 0.5}
+  {\large\bfseries version 0.6}
 
 \vspace{3cm}
 
 {\large\emph{by}}
 
 \vspace{1.25cm}
 
- {\Large\bfseries Cosmin G. Petra} and {\Large\bfseries Nai-Yuan Chiang}
+ {\Large\bfseries Cosmin G. Petra}, {\Large\bfseries Nai-Yuan Chiang}, and {\Large\bfseries Jingyi Wang}
 
 \vspace{1.1cm}
 
@@ -154,7 +154,7 @@
 \vspace{4.75cm}
 
  \textcolor{violet}{{\large\bfseries Oct 15, 2017} \\
-{\large\bfseries Updated  Sept 28, 2021}}
+{\large\bfseries Updated  March 31, 2022}}
 
 \vspace{0.75cm}
 
@@ -757,9 +757,9 @@ \subsection{Structured NLPs suitable to primal decomposition (PriDec) schemes}\l
 
 The user can safely assume that $q(x)$ is a strictly  convex quadratic function (however the function may be only convex and nonquadratic in a future version of \Hi). \Hi assumes that the user can solve the master problem~\eqref{pridemobj}-\eqref{pridembounds} in some efficient way and that the user can return the optimal solution vector. In the examples given, the master problem is setup and solved with \Hi.
 
-\bigskip
+\medskip
 
-The PriDec solver is part of v0.5 as a release candidate. The next major release of \Hi will address a couple of limitations related to switching between memory spaces, profile and tune the memory-distributed parallel performance at extreme scales, and improve documentation. The users interested in \Hi's PriDec solver should consult \texttt{nlpPriDec\_ex8} and \texttt{nlpPriDec\_ex9} examples under the \texttt{Drivers} directory and should also feel free to contact the developers.
+Self-contained examples of the use of \Hi's PriDec solver are present in  \texttt{nlpPriDec\_ex8} and \texttt{nlpPriDec\_ex9} examples under the \texttt{Drivers} directory. 
 
 %[[to do:]] describe C++ interface 
 %