diff --git a/doc/Projects/ProjectWriting/projectwriting.ipynb b/doc/Projects/ProjectWriting/projectwriting.ipynb index 92c215f4e..531e0ccde 100644 --- a/doc/Projects/ProjectWriting/projectwriting.ipynb +++ b/doc/Projects/ProjectWriting/projectwriting.ipynb @@ -3,9 +3,7 @@ { "cell_type": "markdown", "id": "8b587bcb", - "metadata": { - "editable": true - }, + "metadata": {}, "source": [ "\n", @@ -15,9 +13,7 @@ { "cell_type": "markdown", "id": "ad025527", - "metadata": { - "editable": true - }, + "metadata": {}, "source": [ "# How to write a scientific project\n", "**Morten Hjorth-Jensen**, Department of Physics, University of Oslo and Department of Physics and Astronomy and National Superconducting Cyclotron Laboratory, Michigan State University\n", @@ -30,9 +26,7 @@ { "cell_type": "markdown", "id": "28e54722", - "metadata": { - "editable": true - }, + "metadata": {}, "source": [ "## The report: how to write a good scienfitic/technical report\n", "**What should it contain? A typical structure.**\n", @@ -59,9 +53,7 @@ { "cell_type": "markdown", "id": "450156e7", - "metadata": { - "editable": true - }, + "metadata": {}, "source": [ "## The report, the abstract\n", "The abstract gives the reader a quick overview of what has been done and the most important results. Here is a typical example\n", @@ -75,9 +67,7 @@ { "cell_type": "markdown", "id": "a5a7f13f", - "metadata": { - "editable": true - }, + "metadata": {}, "source": [ "## The report, the introduction\n", "**What should I focus on? Introduction.**\n", @@ -93,9 +83,7 @@ { "cell_type": "markdown", "id": "a80f8a9f", - "metadata": { - "editable": true - }, + "metadata": {}, "source": [ "## The report, discussion of methods and codes\n", "**What should I focus on? Methods sections.**\n", @@ -112,9 +100,7 @@ { "cell_type": "markdown", "id": "57974a1d", - "metadata": { - "editable": true - }, + "metadata": {}, "source": [ "## The report, code part\n", "\n", @@ -134,9 +120,7 @@ { "cell_type": "markdown", "id": "448f9828", - "metadata": { - "editable": true - }, + "metadata": {}, "source": [ "## The report, results part\n", "**What should I focus on? Results.**\n", @@ -155,9 +139,7 @@ { "cell_type": "markdown", "id": "fa3190a7", - "metadata": { - "editable": true - }, + "metadata": {}, "source": [ "## The report, conclusions and perspectives\n", "**What should I focus on? Conclusions.**\n", @@ -172,9 +154,7 @@ { "cell_type": "markdown", "id": "4b15f2a0", - "metadata": { - "editable": true - }, + "metadata": {}, "source": [ "## The report, appendices\n", "**What should I focus on? additional material.**\n", @@ -191,9 +171,7 @@ { "cell_type": "markdown", "id": "e982ec47", - "metadata": { - "editable": true - }, + "metadata": {}, "source": [ "## The report, references\n", "**What should I focus on? References.**\n", @@ -208,9 +186,7 @@ { "cell_type": "markdown", "id": "ae212bd2", - "metadata": { - "editable": true - }, + "metadata": {}, "source": [ "## Where do I find scientific articles, books etc and examples of reports\n", " * With a UiO IP number you can access freely all books and scientific journals available at our [University library](http://www.ub.uio.no/)\n", @@ -221,9 +197,7 @@ { "cell_type": "markdown", "id": "7d783b6f", - "metadata": { - "editable": true - }, + "metadata": {}, "source": [ "## Other resources\n", "\n", @@ -234,9 +208,7 @@ { "cell_type": "markdown", "id": "47b07b08", - "metadata": { - "editable": true - }, + "metadata": {}, "source": [ "## Procrastination... the curse of all?\n", "\n", @@ -251,7 +223,25 @@ ] } ], - "metadata": {}, + "metadata": { + "kernelspec": { + "display_name": "Python 3 (ipykernel)", + "language": "python", + "name": "python3" + }, + "language_info": { + "codemirror_mode": { + "name": "ipython", + "version": 3 + }, + "file_extension": ".py", + "mimetype": "text/x-python", + "name": "python", + "nbconvert_exporter": "python", + "pygments_lexer": "ipython3", + "version": "3.9.10" + } + }, "nbformat": 4, "nbformat_minor": 5 } diff --git a/doc/pub/week39/html/week39-reveal.html b/doc/pub/week39/html/week39-reveal.html index 3d840a792..41138aa98 100644 --- a/doc/pub/week39/html/week39-reveal.html +++ b/doc/pub/week39/html/week39-reveal.html @@ -244,6 +244,9 @@ MathJax.Hub.Config({
+
+
+
Convex function: Let \( X \subset \mathbb{R}^n \) be a convex set. Assume that the function \( f: X \rightarrow \mathbb{R} \) is continuous, then \( f \) is said to be convex if Convex function: Let \( X \subset \mathbb{R}^n \) be a convex
+set. Assume that the function \( f: X \rightarrow \mathbb{R} \) is
+continuous, then \( f \) is said to be convex if \( f(tx_1 + (1-t)x_2) \leq tf(x_1) + (1-t)f(x_2) \)
+for all \( x_1, x_2 \in X \) and for all \( t \in [0,1] \).
+If \( \leq \) is replaced with a strict inequaltiy in the
+definition, we demand \( x_1 \neq x_2 \) and \( t\in(0,1) \) then \( f \) is said
+to be strictly convex. For a single variable function, convexity means
+that if you draw a straight line connecting \( f(x_1) \) and \( f(x_2) \), the
+value of the function on the interval \( [x_1,x_2] \) is always below the
+line as illustrated below.
+ In the following we state first and second-order conditions which
ensures convexity of a function \( f \). We write \( D_f \) to denote the
domain of \( f \), i.e the subset of \( R^n \) where \( f \) is defined. For more
-details and proofs we refer to: S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press.
+details and proofs we refer to: S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press.
Convex function: Let \( X \subset \mathbb{R}^n \) be a convex set. Assume that the function \( f: X \rightarrow \mathbb{R} \) is continuous, then \( f \) is said to be convex if $$f(tx_1 + (1-t)x_2) \leq tf(x_1) + (1-t)f(x_2) $$ for all \( x_1, x_2 \in X \) and for all \( t \in [0,1] \). If \( \leq \) is replaced with a strict inequaltiy in the definition, we demand \( x_1 \neq x_2 \) and \( t\in(0,1) \) then \( f \) is said to be strictly convex. For a single variable function, convexity means that if you draw a straight line connecting \( f(x_1) \) and \( f(x_2) \), the value of the function on the interval \( [x_1,x_2] \) is always below the line as illustrated below. Convex function: Let \( X \subset \mathbb{R}^n \) be a convex
+set. Assume that the function \( f: X \rightarrow \mathbb{R} \) is
+continuous, then \( f \) is said to be convex if \( f(tx_1 + (1-t)x_2) \leq tf(x_1) + (1-t)f(x_2) \)
+for all \( x_1, x_2 \in X \) and for all \( t \in [0,1] \).
+If \( \leq \) is replaced with a strict inequaltiy in the
+definition, we demand \( x_1 \neq x_2 \) and \( t\in(0,1) \) then \( f \) is said
+to be strictly convex. For a single variable function, convexity means
+that if you draw a straight line connecting \( f(x_1) \) and \( f(x_2) \), the
+value of the function on the interval \( [x_1,x_2] \) is always below the
+line as illustrated below.
+ In the following we state first and second-order conditions which
ensures convexity of a function \( f \). We write \( D_f \) to denote the
domain of \( f \), i.e the subset of \( R^n \) where \( f \) is defined. For more
-details and proofs we refer to: S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press.
+details and proofs we refer to: S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press.
Convex function: Let \( X \subset \mathbb{R}^n \) be a convex set. Assume that the function \( f: X \rightarrow \mathbb{R} \) is continuous, then \( f \) is said to be convex if $$f(tx_1 + (1-t)x_2) \leq tf(x_1) + (1-t)f(x_2) $$ for all \( x_1, x_2 \in X \) and for all \( t \in [0,1] \). If \( \leq \) is replaced with a strict inequaltiy in the definition, we demand \( x_1 \neq x_2 \) and \( t\in(0,1) \) then \( f \) is said to be strictly convex. For a single variable function, convexity means that if you draw a straight line connecting \( f(x_1) \) and \( f(x_2) \), the value of the function on the interval \( [x_1,x_2] \) is always below the line as illustrated below. Convex function: Let \( X \subset \mathbb{R}^n \) be a convex
+set. Assume that the function \( f: X \rightarrow \mathbb{R} \) is
+continuous, then \( f \) is said to be convex if \( f(tx_1 + (1-t)x_2) \leq tf(x_1) + (1-t)f(x_2) \)
+for all \( x_1, x_2 \in X \) and for all \( t \in [0,1] \).
+If \( \leq \) is replaced with a strict inequaltiy in the
+definition, we demand \( x_1 \neq x_2 \) and \( t\in(0,1) \) then \( f \) is said
+to be strictly convex. For a single variable function, convexity means
+that if you draw a straight line connecting \( f(x_1) \) and \( f(x_2) \), the
+value of the function on the interval \( [x_1,x_2] \) is always below the
+line as illustrated below.
+ In the following we state first and second-order conditions which
ensures convexity of a function \( f \). We write \( D_f \) to denote the
domain of \( f \), i.e the subset of \( R^n \) where \( f \) is defined. For more
-details and proofs we refer to: S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press.
+details and proofs we refer to: S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press.
Convex function
-
-$$f(tx_1 + (1-t)x_2) \leq tf(x_1) + (1-t)f(x_2) $$
-
for all \( x_1, x_2 \in X \) and for all \( t \in [0,1] \). If \( \leq \) is replaced with a strict inequaltiy in the definition, we demand \( x_1 \neq x_2 \) and \( t\in(0,1) \) then \( f \) is said to be strictly convex. For a single variable function, convexity means that if you draw a straight line connecting \( f(x_1) \) and \( f(x_2) \), the value of the function on the interval \( [x_1,x_2] \) is always below the line as illustrated below.
Convex function
-
Conditions on convex functions
@@ -681,7 +693,7 @@ regular polygons (triangles, rectangles, pentagons, etc...).
Convex function
-
Conditions on convex functions
@@ -758,7 +770,7 @@ regular polygons (triangles, rectangles, pentagons, etc...).