Final edits.

convexengineering · Jun 28, 2019 · 3dbb47b · 3dbb47b
1 parent 86e5234
commit 3dbb47b
Show file tree

Hide file tree

Showing 3 changed files with 4 additions and 6 deletions.
diff --git a/docs/source/index.rst b/docs/source/index.rst
@@ -13,8 +13,8 @@ Robust optimization is a tractable stochastic optimization
 method that protects against uncertain parameters in 
 well-defined sets, and optimizes for the worst case objective. 
 
-This website is under construction. If you have 
-a GP model that you would like to robustify but are not able to find answers to your questions in the documentation,
+This website is under construction. If you are
+not able to find answers to your questions in the documentation.
 please feel free to post `issues <https://github.com/convexengineering/robust/issues>`_
 and suggest areas for improvement.
 

diff --git a/docs/source/robust101.rst b/docs/source/robust101.rst
@@ -1,8 +1,6 @@
 Robust optimization 101
 ***********************
 
-This section will help you understand the basic ideas behind robust optimization (RO).
-
 RO is a tractable method for optimization under uncertainty, and specifically under uncertain
 parameters. It optimizes the worst-case objective outcome over uncertainty sets,
 unlike general stochastic optimization methods which optimize statistics of the distribution

diff --git a/docs/source/rspapproaches.rst b/docs/source/rspapproaches.rst
@@ -3,9 +3,9 @@
 Approaches to solving robust SPs
 ================================
 
-*(borrowed from [Ozturk, 2019])*
+*(paraphrased from [Ozturk, 2019])*
 
-This section presents a heuristic algorithm to solve a RSP
+**robust** implements a heuristic to solve a RSP
 based on our previous discussion on robust geometric programming.
 
 General RSP Solver