Difference between revisions of "2020 Cornell Optimization Open Textbook Feedback"

From Cornell University Computational Optimization Open Textbook - Optimization Wiki
Jump to navigation Jump to search
Line 1: Line 1:
 
==[[Duality]]==
 
==[[Duality]]==
  
* An introduction of the topic
 
 
* Theory, methodology, and/or algorithmic discussions
 
* Theory, methodology, and/or algorithmic discussions
 
*# Double check indexes in the dual problem. LHS of the dual problem constraint should be aji.
 
*# Double check indexes in the dual problem. LHS of the dual problem constraint should be aji.
Line 7: Line 6:
 
*# Please add more details to the KKT Conditions section.
 
*# Please add more details to the KKT Conditions section.
 
*# Remove colon in the subsection title  
 
*# Remove colon in the subsection title  
* At least one numerical example
 
* A section to discuss and/or illustrate the applications
 
* A conclusion section
 
 
* References
 
* References
 
*# Lecture notes may not be a credible reference. Please find the original source.
 
*# Lecture notes may not be a credible reference. Please find the original source.
Line 15: Line 11:
 
==[[Simplex algorithm]]==
 
==[[Simplex algorithm]]==
  
* An introduction of the topic
 
 
* Theory, methodology, and/or algorithmic discussions
 
* Theory, methodology, and/or algorithmic discussions
 
*# The symbol i in the second expression in dictionary functions, ranges from 1 to m.
 
*# The symbol i in the second expression in dictionary functions, ranges from 1 to m.
* At least one numerical example
+
* References
* A section to discuss and/or illustrate the applications
+
*# Please be consistent with referencing style.
* A conclusion section
 
* References 1. Please be consistent with referencing style.  
 
  
 
==[[Computational complexity]]==
 
==[[Computational complexity]]==
  
* An introduction of the topic
 
 
* Theory, methodology, and/or algorithmic discussions
 
* Theory, methodology, and/or algorithmic discussions
 
*# Please introduce the Big-oh notation in this section.
 
*# Please introduce the Big-oh notation in this section.
Line 32: Line 24:
 
* A section to discuss and/or illustrate the applications
 
* A section to discuss and/or illustrate the applications
 
*# The applications mentioned need to be discussed further.  
 
*# The applications mentioned need to be discussed further.  
* A conclusion section
 
* References.
 
  
 
==[[Network flow problem]]==
 
==[[Network flow problem]]==
  
* An introduction of the topic
 
* Theory, methodology, and/or algorithmic discussions.
 
 
* At least one numerical example
 
* At least one numerical example
 
*# There is NO need to include code. Simply mention how the problem was coded along with details on the LP solver used.
 
*# There is NO need to include code. Simply mention how the problem was coded along with details on the LP solver used.
 
*# The subsection title style should be consistent.
 
*# The subsection title style should be consistent.
* A section to discuss and/or illustrate the application
 
* A conclusion section
 
* References
 
  
 
==[[Interior-point method for LP]]==
 
==[[Interior-point method for LP]]==
Line 51: Line 36:
 
*# Fix typos “where A ε R”
 
*# Fix typos “where A ε R”
 
*# Please type “minimize” and “subject to” in formal optimization problem form throughout the whole page.
 
*# Please type “minimize” and “subject to” in formal optimization problem form throughout the whole page.
* Theory, methodology, and/or algorithmic discussions
 
 
* At least one numerical example
 
* At least one numerical example
 
*# The numerical example does not use any Newton’s method iterations that are presented in the above section. Please consider using a complicated example that actually uses Newton’s iterations.
 
*# The numerical example does not use any Newton’s method iterations that are presented in the above section. Please consider using a complicated example that actually uses Newton’s iterations.
Line 57: Line 41:
 
* A section to discuss and/or illustrate the applications
 
* A section to discuss and/or illustrate the applications
 
*# Please double check typos and extra spaces.
 
*# Please double check typos and extra spaces.
* A conclusion section
 
* References
 
  
 
==[[Optimization with absolute values]]==
 
==[[Optimization with absolute values]]==
Line 66: Line 48:
 
* Theory, methodology, and/or algorithmic discussions
 
* Theory, methodology, and/or algorithmic discussions
 
*# Please add more details to absolute values in nonlinear optimization. (very important!)
 
*# Please add more details to absolute values in nonlinear optimization. (very important!)
* At least one numerical example
 
 
* A section to discuss and/or illustrate the applications
 
* A section to discuss and/or illustrate the applications
 
*# Inline equations at the beginning of this section are not formatted properly. Please fix the notation for expected return throughout the section.
 
*# Inline equations at the beginning of this section are not formatted properly. Please fix the notation for expected return throughout the section.
* A conclusion section
 
* References
 
  
 
==[[Matrix game (LP for game theory)]]==
 
==[[Matrix game (LP for game theory)]]==
  
* An introduction of the topic
 
 
* Theory, methodology, and/or algorithmic discussions
 
* Theory, methodology, and/or algorithmic discussions
 
*# aij are not defined in this section.
 
*# aij are not defined in this section.
* At least one numerical example
 
*# Interesting example, very well explained.
 
* A section to discuss and/or illustrate the applications
 
* A conclusion section
 
 
* References
 
* References
 
*# Please consider linking the references by using this as Wiki template, [[Quantum computing for optimization|https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization]]
 
*# Please consider linking the references by using this as Wiki template, [[Quantum computing for optimization|https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization]]
Line 86: Line 60:
 
==[[Quasi-Newton methods]]==
 
==[[Quasi-Newton methods]]==
  
* An introduction of the topic
 
 
* Theory, methodology, and/or algorithmic discussions
 
* Theory, methodology, and/or algorithmic discussions
 
*# Please ensure that few spaces are kept between the equations and equation numbers.
 
*# Please ensure that few spaces are kept between the equations and equation numbers.
 
*# Step 6 of DFP algorithm should use the same variable M as in equation 1.14.
 
*# Step 6 of DFP algorithm should use the same variable M as in equation 1.14.
* At least one numerical example
 
* A section to discuss and/or illustrate the applications
 
* A conclusion section
 
* References
 
  
 
== [[Markov decision process]] ==
 
== [[Markov decision process]] ==
Line 101: Line 70:
 
* Theory, methodology, and/or algorithmic discussions
 
* Theory, methodology, and/or algorithmic discussions
 
*# If abbreviations are defined like MDP, use the abbreviations throughout the Wiki.
 
*# If abbreviations are defined like MDP, use the abbreviations throughout the Wiki.
* At least one numerical example
 
* A section to discuss and/or illustrate the applications
 
* A conclusion section
 
 
* References
 
* References
 
*# Please consider linking the references by using this as Wiki template, [[Quantum computing for optimization|https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization]]
 
*# Please consider linking the references by using this as Wiki template, [[Quantum computing for optimization|https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization]]
Line 109: Line 75:
 
==[[Eight step procedures]]==
 
==[[Eight step procedures]]==
  
* An introduction of the topic
 
* Theory, methodology, and/or algorithmic discussions
 
 
* At least one numerical example
 
* At least one numerical example
 
*# Please be consistent in the formatting of mathematical notations and equations.
 
*# Please be consistent in the formatting of mathematical notations and equations.
* A section to discuss and/or illustrate the applications
 
* A conclusion section
 
 
* References
 
* References
 
*# Lecture notes may not be a credible reference. Please find the original source.
 
*# Lecture notes may not be a credible reference. Please find the original source.
Line 120: Line 82:
 
==[[Facility location problem]]==
 
==[[Facility location problem]]==
  
* An introduction of the topic
 
* Theory, methodology, and/or algorithmic discussions
 
 
* At least one numerical example
 
* At least one numerical example
 
*# Mention how the formulated problem is coded and solved. No need to provide GAMS code.
 
*# Mention how the formulated problem is coded and solved. No need to provide GAMS code.
* A section to discuss and/or illustrate the applications
 
* A conclusion section
 
 
* References
 
* References
 
*# Please consider linking the references by using this as Wiki template, [[Quantum computing for optimization|https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization]]
 
*# Please consider linking the references by using this as Wiki template, [[Quantum computing for optimization|https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization]]
Line 131: Line 89:
 
==[[Set covering problem]]==
 
==[[Set covering problem]]==
  
* An introduction of the topic
 
 
* Theory, methodology, and/or algorithmic discussions
 
* Theory, methodology, and/or algorithmic discussions
 
*# Use proper math notations for “greater than equal to”.
 
*# Use proper math notations for “greater than equal to”.
Line 138: Line 95:
 
*# The numerical example is solved manually without using greedy method nor LP solution method. Please solve this example both by the presented greedy algorithm and the newly added LP-based method and finally compare solutions.
 
*# The numerical example is solved manually without using greedy method nor LP solution method. Please solve this example both by the presented greedy algorithm and the newly added LP-based method and finally compare solutions.
 
*# Please leave some space between equation and equation number.
 
*# Please leave some space between equation and equation number.
* A section to discuss and/or illustrate the applications
 
* A conclusion section
 
* References
 
  
 
==[[Quadratic assignment problem]]==
 
==[[Quadratic assignment problem]]==
  
* An introduction of the topic
 
 
* Theory, methodology, and/or algorithmic discussions
 
* Theory, methodology, and/or algorithmic discussions
 
*# Discuss dynamic programming and cutting plane solution techniques briefly.
 
*# Discuss dynamic programming and cutting plane solution techniques briefly.
* At least one numerical example
 
 
* A section to discuss and/or illustrate the applications
 
* A section to discuss and/or illustrate the applications
 
*# Please format the equation for definition of yij in the hospital layout subsection.
 
*# Please format the equation for definition of yij in the hospital layout subsection.
* A conclusion section
 
* References
 
  
 
==[[Newsvendor problem]]==
 
==[[Newsvendor problem]]==
  
* An introduction of the topic
 
 
* Theory, methodology, and/or algorithmic discussions
 
* Theory, methodology, and/or algorithmic discussions
 
*# A math programming formulation of the optimization problem with objective function and constraints is expected for the formulation. Please add any variant of the newsvendor problem along with some operational constraints.
 
*# A math programming formulation of the optimization problem with objective function and constraints is expected for the formulation. Please add any variant of the newsvendor problem along with some operational constraints.
 
*# A mathematical presentation of the solution technique is expected. Please consider any distribution for R  and present a solution technique for that specific problem.  
 
*# A mathematical presentation of the solution technique is expected. Please consider any distribution for R  and present a solution technique for that specific problem.  
* At least one numerical example
 
* A section to discuss and/or illustrate the applications
 
* A conclusion section
 
* References
 
  
 
==[[Mixed-integer cuts]]==
 
==[[Mixed-integer cuts]]==
  
* An introduction of the topic
 
* Theory, methodology, and/or algorithmic discussions
 
* At least one numerical example
 
 
* A section to discuss and/or illustrate the applications
 
* A section to discuss and/or illustrate the applications
 
*# MILP and their solution techniques involving cuts are extremely versatile. Yet, only two sentences are added to describe their applications. Please discuss their applications, preferably real-world applications, in brief. Example Wikis provided on the website could be used as a reference to do so.
 
*# MILP and their solution techniques involving cuts are extremely versatile. Yet, only two sentences are added to describe their applications. Please discuss their applications, preferably real-world applications, in brief. Example Wikis provided on the website could be used as a reference to do so.
* A conclusion section
 
* References
 
  
 
==[[Column generation algorithms]]==
 
==[[Column generation algorithms]]==
Line 181: Line 121:
 
*# Some minor typos/article agreement issues exist “is not partical in real-world”.
 
*# Some minor typos/article agreement issues exist “is not partical in real-world”.
 
*# Referencing subtitle "Methodology" is not a formal way.  
 
*# Referencing subtitle "Methodology" is not a formal way.  
* At least one numerical example
 
* A section to discuss and/or illustrate the applications
 
* A conclusion section
 
* References
 
  
 
==[[Heuristic algorithms]]==
 
==[[Heuristic algorithms]]==
  
* An introduction of the topic
 
 
* Theory, methodology, and/or algorithmic discussions
 
* Theory, methodology, and/or algorithmic discussions
 
*# Please use proper symbol for "greater than or equal to".
 
*# Please use proper symbol for "greater than or equal to".
 
*# Greedy method to solve minimum spanning tree seems to be missing.
 
*# Greedy method to solve minimum spanning tree seems to be missing.
* At least one numerical example
 
* A section to discuss and/or illustrate the applications
 
* A conclusion section
 
* Reference
 
  
 
==[[Branch and cut]]==
 
==[[Branch and cut]]==
  
* An introduction of the topic
 
 
* Theory, methodology, and/or algorithmic discussions
 
* Theory, methodology, and/or algorithmic discussions
 
*# Equation in most infeasible branching section is not properly formatted, please fix the same.
 
*# Equation in most infeasible branching section is not properly formatted, please fix the same.
Line 205: Line 135:
 
*# Step 5 contains latex code terms that are not properly formatted. Please fix the same.
 
*# Step 5 contains latex code terms that are not properly formatted. Please fix the same.
 
*# Fix typos:  e.g., repeated “for the current”, men Problem can viewed as partially” ..
 
*# Fix typos:  e.g., repeated “for the current”, men Problem can viewed as partially” ..
* At least one numerical example
 
* A section to discuss and/or illustrate the applications
 
* A conclusion section
 
* References
 
  
 
== [[Mixed-integer linear fractional programming (MILFP)]] ==
 
== [[Mixed-integer linear fractional programming (MILFP)]] ==
  
* An introduction of the topic
 
* Theory, methodology, and/or algorithmic discussions
 
 
* At least one numerical example
 
* At least one numerical example
 
*# Please check the index notation in Mass Balance Constraints.
 
*# Please check the index notation in Mass Balance Constraints.
* A section to discuss and/or illustrate the applications
 
* A conclusion section
 
 
* References
 
* References
 
*# Please consider linking the citations to references in the reference list by using this as Wiki template, rather than using website links. [[Quantum computing for optimization|https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization]]
 
*# Please consider linking the citations to references in the reference list by using this as Wiki template, rather than using website links. [[Quantum computing for optimization|https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization]]
Line 226: Line 148:
 
*# Please refrain from defining the same abbreviations multiple times.
 
*# Please refrain from defining the same abbreviations multiple times.
 
*# Please use abbreviations throughout the page if they have been defined.
 
*# Please use abbreviations throughout the page if they have been defined.
* Theory, methodology, and/or algorithmic discussions
 
 
* At least one numerical example
 
* At least one numerical example
 
*# There is a duplicate figure.  
 
*# There is a duplicate figure.  
* A section to discuss and/or illustrate the applications
 
* A conclusion section
 
* References
 
  
 
==[[Fuzzy programming]]==
 
==[[Fuzzy programming]]==
Line 237: Line 155:
 
* An introduction of the topic
 
* An introduction of the topic
 
*# References at the end of the sentence should be placed after the period.
 
*# References at the end of the sentence should be placed after the period.
* Theory, methodology, and/or algorithmic discussions
 
*# Very well written.
 
 
* At least one numerical example
 
* At least one numerical example
 
*# The numeric example should be before the applications section.
 
*# The numeric example should be before the applications section.
 
* A section to discuss and/or illustrate the applications
 
* A section to discuss and/or illustrate the applications
 
*# Applications of fuzzy programming are quite versatile. Please discuss few of the mentioned applications briefly. The provided example Wikis can be used as a reference to write this section.
 
*# Applications of fuzzy programming are quite versatile. Please discuss few of the mentioned applications briefly. The provided example Wikis can be used as a reference to write this section.
* A conclusion section
 
 
* References
 
* References
 
*# Please consider linking the references by using this as Wiki template, [[Quantum computing for optimization|https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization]]
 
*# Please consider linking the references by using this as Wiki template, [[Quantum computing for optimization|https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization]]
Line 249: Line 164:
 
==[[Adaptive robust optimization]]==
 
==[[Adaptive robust optimization]]==
  
* An introduction of the topic
 
 
* Theory, methodology, and/or algorithmic discussions
 
* Theory, methodology, and/or algorithmic discussions
 
*# Please check typos such as "Let ''u'' bee a vector".
 
*# Please check typos such as "Let ''u'' bee a vector".
 
*# The abbreviation KKT is not previously defined.
 
*# The abbreviation KKT is not previously defined.
* At least one numerical example
 
* A section to discuss and/or illustrate the applications
 
* A conclusion section
 
* References
 
*# Overall, very well written.
 
  
 
== [[Stochastic gradient descent]] ==
 
== [[Stochastic gradient descent]] ==
* An introduction of the topic
 
* Theory, methodology, and/or algorithmic discussions
 
 
* At least one numerical example
 
* At least one numerical example
 
*# Amount of whitespace can be reduced by changing orientation of example dataset by converting it into a table containing 3 rows and 6 columns.
 
*# Amount of whitespace can be reduced by changing orientation of example dataset by converting it into a table containing 3 rows and 6 columns.
 
* A section to discuss and/or illustrate the applications
 
* A section to discuss and/or illustrate the applications
 
*# Deep learning can become a subsection on its own.
 
*# Deep learning can become a subsection on its own.
* A conclusion section
 
* References
 
  
 
==[[RMSProp]]==
 
==[[RMSProp]]==
Line 275: Line 180:
 
* Theory, methodology, and/or algorithmic discussions
 
* Theory, methodology, and/or algorithmic discussions
 
*# Please check grammar in this section.
 
*# Please check grammar in this section.
* At least one numerical example
 
 
* A section to discuss and/or illustrate the applications
 
* A section to discuss and/or illustrate the applications
 
*# The applications section does not contain any discussion on applications. Please mention a few applications of the widely used RMSprop and discuss them briefly.
 
*# The applications section does not contain any discussion on applications. Please mention a few applications of the widely used RMSprop and discuss them briefly.
 
*# Please check grammar in this section.
 
*# Please check grammar in this section.
* A conclusion section
 
 
* References
 
* References
 
*# Please refer to the example Wikis provided to use proper citation style.
 
*# Please refer to the example Wikis provided to use proper citation style.
Line 286: Line 189:
 
==[[Adam]]==
 
==[[Adam]]==
  
* An introduction of the topic
 
 
* Theory, methodology, and/or algorithmic discussions
 
* Theory, methodology, and/or algorithmic discussions
 
*# References at the end of the sentence should be placed after the period.
 
*# References at the end of the sentence should be placed after the period.
* At least one numerical example
 
* A section to discuss and/or illustrate the applications
 
* A conclusion section
 
* References
 
*# Overall, very well written.
 

Revision as of 21:52, 14 December 2020

Duality

  • Theory, methodology, and/or algorithmic discussions
    1. Double check indexes in the dual problem. LHS of the dual problem constraint should be aji.
    2. Equations in the “constructing the dual” subsection should be aligned properly.
    3. Please add more details to the KKT Conditions section.
    4. Remove colon in the subsection title
  • References
    1. Lecture notes may not be a credible reference. Please find the original source.

Simplex algorithm

  • Theory, methodology, and/or algorithmic discussions
    1. The symbol i in the second expression in dictionary functions, ranges from 1 to m.
  • References
    1. Please be consistent with referencing style.

Computational complexity

  • Theory, methodology, and/or algorithmic discussions
    1. Please introduce the Big-oh notation in this section.
  • At least one numerical example
    1. Examples of combinatorial optimization is suggested.
  • A section to discuss and/or illustrate the applications
    1. The applications mentioned need to be discussed further.

Network flow problem

  • At least one numerical example
    1. There is NO need to include code. Simply mention how the problem was coded along with details on the LP solver used.
    2. The subsection title style should be consistent.

Interior-point method for LP

  • An introduction of the topic
    1. Fix typos “where A ε R”
    2. Please type “minimize” and “subject to” in formal optimization problem form throughout the whole page.
  • At least one numerical example
    1. The numerical example does not use any Newton’s method iterations that are presented in the above section. Please consider using a complicated example that actually uses Newton’s iterations.
    2. Please type the maximization problem in LaTex form.
  • A section to discuss and/or illustrate the applications
    1. Please double check typos and extra spaces.

Optimization with absolute values

  • An introduction of the topic
    1. Add few sentences on how absolute values convert optimization problem into a nonlinear optimization problem.
  • Theory, methodology, and/or algorithmic discussions
    1. Please add more details to absolute values in nonlinear optimization. (very important!)
  • A section to discuss and/or illustrate the applications
    1. Inline equations at the beginning of this section are not formatted properly. Please fix the notation for expected return throughout the section.

Matrix game (LP for game theory)

Quasi-Newton methods

  • Theory, methodology, and/or algorithmic discussions
    1. Please ensure that few spaces are kept between the equations and equation numbers.
    2. Step 6 of DFP algorithm should use the same variable M as in equation 1.14.

Markov decision process

Eight step procedures

  • At least one numerical example
    1. Please be consistent in the formatting of mathematical notations and equations.
  • References
    1. Lecture notes may not be a credible reference. Please find the original source.

Facility location problem

Set covering problem

  • Theory, methodology, and/or algorithmic discussions
    1. Use proper math notations for “greater than equal to”.
  • At least one numerical example
    1. Since Table 3 provides information on aij required to formulate the constraints, Table 2 serves no purpose and should be removed from the Wiki. Table 3 can be directly generated from Table 1.
    2. The numerical example is solved manually without using greedy method nor LP solution method. Please solve this example both by the presented greedy algorithm and the newly added LP-based method and finally compare solutions.
    3. Please leave some space between equation and equation number.

Quadratic assignment problem

  • Theory, methodology, and/or algorithmic discussions
    1. Discuss dynamic programming and cutting plane solution techniques briefly.
  • A section to discuss and/or illustrate the applications
    1. Please format the equation for definition of yij in the hospital layout subsection.

Newsvendor problem

  • Theory, methodology, and/or algorithmic discussions
    1. A math programming formulation of the optimization problem with objective function and constraints is expected for the formulation. Please add any variant of the newsvendor problem along with some operational constraints.
    2. A mathematical presentation of the solution technique is expected. Please consider any distribution for R  and present a solution technique for that specific problem.

Mixed-integer cuts

  • A section to discuss and/or illustrate the applications
    1. MILP and their solution techniques involving cuts are extremely versatile. Yet, only two sentences are added to describe their applications. Please discuss their applications, preferably real-world applications, in brief. Example Wikis provided on the website could be used as a reference to do so.

Column generation algorithms

  • An introduction of the topic
    1. References at the end of the sentence should be placed after the period.
  • Theory, methodology, and/or algorithmic discussions
    1. Some minor typos/article agreement issues exist “is not partical in real-world”.
    2. Referencing subtitle "Methodology" is not a formal way.

Heuristic algorithms

  • Theory, methodology, and/or algorithmic discussions
    1. Please use proper symbol for "greater than or equal to".
    2. Greedy method to solve minimum spanning tree seems to be missing.

Branch and cut

  • Theory, methodology, and/or algorithmic discussions
    1. Equation in most infeasible branching section is not properly formatted, please fix the same.
    2. Step 2 appears abruptly in the algorithm and does not explain much. Please add more information regarding the same.
    3. Step 5 contains latex code terms that are not properly formatted. Please fix the same.
    4. Fix typos:  e.g., repeated “for the current”, men Problem can viewed as partially” ..

Mixed-integer linear fractional programming (MILFP)

Convex generalized disjunctive programming (GDP)

  • An introduction of the topic
    1. Please refrain from defining the same abbreviations multiple times.
    2. Please use abbreviations throughout the page if they have been defined.
  • At least one numerical example
    1. There is a duplicate figure.

Fuzzy programming

  • An introduction of the topic
    1. References at the end of the sentence should be placed after the period.
  • At least one numerical example
    1. The numeric example should be before the applications section.
  • A section to discuss and/or illustrate the applications
    1. Applications of fuzzy programming are quite versatile. Please discuss few of the mentioned applications briefly. The provided example Wikis can be used as a reference to write this section.
  • References
    1. Please consider linking the references by using this as Wiki template, https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization

Adaptive robust optimization

  • Theory, methodology, and/or algorithmic discussions
    1. Please check typos such as "Let u bee a vector".
    2. The abbreviation KKT is not previously defined.

Stochastic gradient descent

  • At least one numerical example
    1. Amount of whitespace can be reduced by changing orientation of example dataset by converting it into a table containing 3 rows and 6 columns.
  • A section to discuss and/or illustrate the applications
    1. Deep learning can become a subsection on its own.

RMSProp

  • An introduction of the topic
    1. References at the end of the sentence should be placed after the period.
  • Theory, methodology, and/or algorithmic discussions
    1. Please check grammar in this section.
  • A section to discuss and/or illustrate the applications
    1. The applications section does not contain any discussion on applications. Please mention a few applications of the widely used RMSprop and discuss them briefly.
    2. Please check grammar in this section.
  • References
    1. Please refer to the example Wikis provided to use proper citation style.
    2. Please consider linking the references by using this as Wiki template, https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization

Adam

  • Theory, methodology, and/or algorithmic discussions
    1. References at the end of the sentence should be placed after the period.