2021 Cornell Optimization Open Textbook Feedback: Difference between revisions

From Cornell University Computational Optimization Open Textbook - Optimization Wiki
Jump to navigation Jump to search
VisualWikitext
No edit summary
 
(21 intermediate revisions by 3 users not shown)
Line 1: Line 1:
== [[Lagrangean duality|Lagrangian duality]] ==
== [[Lagrangean duality|Lagrangian duality]] ==
* Author list, sections and TOC
* An introduction of the topic
* Theory, methodology, and/or algorithmic discussions
* Theory, methodology, and/or algorithmic discussions
# The Lagrangian variables associated with equality constraints h(x) are unbounded but the Lagrangian dual problem states them as non-negative. Please fix the same.
# The Lagrangian variables associated with equality constraints h(x) are unbounded but the Lagrangian dual problem states them as non-negative. Please fix the same.
Line 8: Line 5:
* At least one numerical example
* At least one numerical example
#  Please update the dual objective function and domain of dual variables accordingly.
#  Please update the dual objective function and domain of dual variables accordingly.
* A section to discuss and/or illustrate the applications
* A conclusion section
* References
== [[Disjunctive inequalities|Disjunctive Inequalities]] ==
* Author list
* 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 conclusion section
* References
==[[Stochastic programming|Stochastic Programming]]==
==[[Stochastic programming|Stochastic Programming]]==
* An introduction of the topic
* An introduction of the topic
# Place references after the period at the end of each sentence. This goes for all the sections in the wiki.
# Place references after the period at the end of each sentence. This goes for all the sections in the wiki.
* Theory, methodology, and/or algorithmic discussions
* Theory, methodology, and/or algorithmic discussions
** The symbol “xi” in the methodology subsection should be explained.
# The inline notations (`x1`, `s1`) should also be typed using LaTex.
** The inline notations (`x1`, `s1`) should also be typed using LaTex.
 
* A section to discuss and/or illustrate the applications;
# I suggest eliminating citing the last name of the first author (i.e. Zhou et al.)
==[[Exponential transformation|Exponential Transformation]]==
 
* Author list
* 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 conclusion section
 
* References
== [[Portfolio optimization|Portfolio Optimization]] ==
 
* Author list
 
* An introduction of the topic


==[[Portfolio optimization|Portfolio Optimization]]==
* Theory, methodology, and/or algorithmic discussions
* Theory, methodology, and/or algorithmic discussions
# Rephrase “Cut the relevant information and conditions in the portfolio optimization, as well as the final requirements into the relevant variables, constraints and linear functions of the linear programming problem.”
# Rephrase “Cut the relevant information and conditions in the portfolio optimization, as well as the final requirements into the relevant variables, constraints and linear functions of the linear programming problem.”
* At least one numerical example
* At least one numerical example
# Fix misspelling “dolling decision variables”.
# Fix misspelling “dolling decision variables”.
* A section to discuss and/or illustrate the applications
* A conclusion section
* A conclusion section
# Need some commas here (second sentence hard to read).
# Need some commas here (second sentence hard to read).
Line 68: Line 22:


== [[Chance-constraint method|Chance constraint method]] ==
== [[Chance-constraint method|Chance constraint method]] ==
* Author list:
* An introduction of the topic


* Theory, methodology, and/or algorithmic discussions
* Theory, methodology, and/or algorithmic discussions
# Some normal text was expressed as equation.
# Some normal text was expressed as equation.
* At least one numerical example
* A section to discuss and/or illustrate the applications
* A conclusion section
* References
==  [[Bayesian Optimization]] ==
==  [[Bayesian Optimization]] ==
* Introduction
# Discussion on applications should be moved to a separate section.
* Theory, methodology, and/or algorithmic discussions
* Theory, methodology, and/or algorithmic discussions
# Captions need reformatting.
# Consider italicizing keywords rather than bolding.
# Please add a citation to the first sentence.
# Avoid pronouns such as “we”.
# Acquisition function figure could be made larger and clearer to improve readability.
# Acquisition function figure could be made larger and clearer to improve readability.
* At least one numerical example
# Any references to functions or methods in code ‘e.g. fmin’ should be properly formatted as code-stylized text.
# Please use the equation editor for min, st., etc.
# Avoid including a figure of the code for this example and explicitly describe the steps to the modeling and solution process instead.
# Avoid pronouns such as “our” and “we”.
* References
* References
# References should be properly formatted, not just hyperlinks. Refer to the link below for an example: [[Quantum computing for optimization|https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization]]
# References should be properly formatted, not just hyperlinks. Refer to the link below for an example: [[Quantum computing for optimization|https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization]] (#2 is still incorrectly formatt


== [[Conjugate gradient methods]]  ==
== [[Conjugate gradient methods]]  ==
* Theory, methodology, and/or algorithmic discussions
* Theory, methodology, and/or algorithmic discussions
# All equations need to be better formatted.
# All equations need to be better formatted.
# Please indent equation blocks.
# Please properly format pseudocode.
# Please properly format pseudocode.
* A conclusion section
* A conclusion section
# Consider adding future research directions
# Consider adding future research directions
== [[Geometric programming|Geometric Programming]] ==
==[[Adam]]==
 
* Author list
 
* 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 conclusion section:
 
* References
 
== [[Adam]] ==
 
* Author list
* An introduction of the topic


* Theory, methodology, and/or algorithmic discussions
* Theory, methodology, and/or algorithmic discussions
# Avoid inserting inline citations after words like “This article..” as it is a bit informal. This could be rephrased or changed to something like “According to author,^[2] …” with author name inserted.
# Avoid inserting inline citations after words like “This article..” as it is a bit informal. This could be rephrased or changed to something like “According to author,^[2] …” with author name inserted.
* At least one numerical example
* A section to discuss and/or illustrate the applications
* A conclusion section
* References
== [[A-star algorithm|a* algorithm]] ==
== [[A-star algorithm|a* algorithm]] ==


* Author list
* An introduction of the topic:
* An introduction of the topic:
# Please consider correcting a few grammatical errors: “Optimal path”, “cross country”, missing period at end of first paragraph, other random capitalizations, etc.
# Please consider correcting a few grammatical errors: “Optimal path”, “cross country”, missing period at end of first paragraph, other random capitalizations, etc.
Line 145: Line 51:
* At least one numerical example
* At least one numerical example
# The numerical example does not show the full computations the algorithm performs. Please show the computation on a smaller example.
# The numerical example does not show the full computations the algorithm performs. Please show the computation on a smaller example.
* A section to discuss and/or illustrate the applications
* A conclusion section
* References
== [[Job shop scheduling|Job-Shop Scheduling Problem]] ==
== [[Job shop scheduling|Job-Shop Scheduling Problem]] ==
* An introduction of the topic


* Theory, methodology, and/or algorithmic discussions
* Theory, methodology, and/or algorithmic discussions


# Since this Wiki focuses on jobshop scheduling, at least two methods are expected. Branch and bound is a general MILP technique, so, it is recommended to add a tailored technique that can only solve specific jobshop scheduling problems. Solving the numerical example with this technique is not necessary.
# Since this Wiki focuses on jobshop scheduling, at least two methods are expected. Branch and bound is a general MILP technique, so, it is recommended to add a tailored technique that can only solve specific jobshop scheduling problems. Solving the numerical example with this technique is not necessary.
* At least one numerical example
* A section to discuss and/or illustrate the applications
* A conclusion section
* References
== [[Optimization in game theory]] ==
== [[Optimization in game theory]] ==
* Author list
* An introduction of the topic


* Theory, methodology, and/or algorithmic discussions
* Theory, methodology, and/or algorithmic discussions
Line 170: Line 62:
# Rephrase “This algorithm utilizes iterated pivoting much like the simplex algorithm used in the simplex algorithm used in linear programming”.
# Rephrase “This algorithm utilizes iterated pivoting much like the simplex algorithm used in the simplex algorithm used in linear programming”.
# Formatting (incomplete).  
# Formatting (incomplete).  
* At least one numerical example
* A section to discuss and/or illustrate the applications
* A conclusion section
* References
* References
# Incorrect reference style.  
# Incorrect reference style.  
Line 181: Line 67:
== [[Trust-region methods]] ==
== [[Trust-region methods]] ==
* An introduction of the topic
* An introduction of the topic
** Avoid pronouns such as “we”. This goes for all other sections as well.
# Avoid pronouns such as “we”. This goes for all other sections as well.


* Theory, methodology, and/or algorithmic discussions
* Theory, methodology, and/or algorithmic discussions
# Organization of ideas in this section needs work.
# Organization of ideas in this section needs work.
# You have not defined explicitly why the Cauchy point is important to compute beyond a vague allusion to performance improvements, which is also wrong (it is useful because of its guarantees for convergence, not performance) It is also misspelled.
# Please format the algorithm in proper algorithmic pseudocode format.
# Please format the algorithm in proper algorithmic pseudocode format.
* References
# Incorrect reference style.
*There are numerous misspellings, grammatical errors, and incorrect claims. Please fix these.


== [[Momentum]] ==
==[[Outer-approximation (OA)|Outer-approximation]]==
* An introduction of the topic
* Theory, methodology, and/or algorithmic discussions
* Theory, methodology, and/or algorithmic discussions
* At least one numerical example
# “Minimize” and “subject to” should be “min” and “s.t.” in MathType (inconsistent formatting)
* A section to discuss and/or illustrate the applications
* References
 
== [[Stochastic dynamic programming|Stochastic Dynamic programming]] ==
 
* Author list
 
* 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 conclusion section
* References
== [[Outer-approximation (OA)|Outer-approximation]] ==
 
* An introduction of the topic
# See formatting guideline below
# Avoid opinionated statements such as “MINLP problems are usually the hardest to solve”.
# Rearrange the text such that the MINLP formulation is in the theory section and keep the introduction in words only.  
* Theory, methodology, and/or algorithmic discussions
# Consider left aligning equations and optimization problem formulations by the “=”. See [[Stochastic programming|https://optimization.cbe.cornell.edu/index.php?title=Stochastic_programming]] for an example
# The sentence “The Outer-Approximation (OA) algorithm was first proposed by Duran and and Grossmann in 1986 to solve MINLP problems.” needs a reference.
* At least one numerical example
# Every iteration should be clearly presented, and solved "step-by-step".
# “Minimize” and “subject to” should be “min” and “s.t.” in MathType
* A section to discuss and/or illustrate the applications
# Does not explicitly point out why OA is applicable (and/or preferred) in these applications, rather than other MINLP approaches (show that the problem formulations are amenable to a solution approach through OA)
# The sentence “... an active research area and there exists a vast number of applications in fields such as engineering, computational chemistry, and finance.” needs references.
# Posting GAMS code on the page is generally inappropriate and discouraged. Please check with the TAs or me if you have a strong desire to post GAMS codes on the Wiki page. A typical textbook should not be limited to a specific software package. If the GAMS code must be posted, please also post ALL other software implementation versions, such as Pyomo and JuliaOPT, among others.
# Consider reformatting to make steps more readable. Inserting spaces and breaking down steps would help.
* A conclusion section
# Too short. Consider discussion on future research direction and discussion on uncertainty
# Please review abbreviations throughout the page. Why is MINLP redefined here? “Outer-Approximation is a well known efficient approach for solving convex mixed-integer nonlinear programs (MINLP)”.
* References
# Include hyperlinks to references if possible. Please consider having the references appear as in this Wiki template, [[Quantum computing for optimization|https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization]]
# Remove "Template:Reflist"


== [[Unit commitment problem]] ==
== [[Unit commitment problem]] ==


* Author list
* An introduction of the topic
# Please expand the introduction and avoid discussions of examples or specific applications in this section.
# The sentence “Nonlinear, Non-convex programming optimization problem.” doesn’t make sense by itself and Non-convex shouldn’t be capitalized. 
* Theory, methodology, and/or algorithmic discussions
# Figure/image format should be revised to better display the content.
# Uppercase characters are used randomly (e.g., “non-convex transmission Constraints”) . Please follow correct language conventions for sentence structure.
# Avoid inserting inline citations after words like “written in matrix form as equation [3]..” or “presented in [3]...” as it is a bit informal when you don’t explicitly name the subject. Also these two sentences are grammatically incorrect and appear to be missing an ending period and comma, respectively.
# Don’t say “written in matrix form as equation..” and just cite the reference, actually write out the equation.
# Properly label the figure in this section with a figure number and improve visibility by making it larger.
* At least one numerical example
# Every iteration should be clearly presented, and solved "step-by-step".
# Label the figures in this section properly with figure numbers.
# Fix typo “while minimize” to “while minimizing”.
# Avoid pronouns such as “we”.
# Use the equation editor when typing equations.
# A numerical example is simply "numerical" and does not need any application context (similar to those numerical problems in HW assignments). There is an Application section where you discuss the applications.
# The Numerical Example section needs a "step-by-step" calculation process and a clear presentation of each step's results. (again, similar to the way of solving an HW problem).
* A section to discuss and/or illustrate the applications:
# I suggest changing the order of the subtitles here. For example, Single-Period Unit Commitment.
* A conclusion section
* References
== [[Frank-Wolfe]] ==
* Author list:
* 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 conclusion section
* References
== [[Line search methods|Line Search Method]] ==
* Author list
* An introduction of the topic
# Expand the introduction and avoid discussion on some of the specific steps in the solution process.
# Provide references here.
* Theory, methodology, and/or algorithmic discussions
# The phrase “are as follows” in the steepest descent method discussion needs to be followed by a colon.
# Rephrase “has a nice convergence theory” and cite a reference for this claim.
# Avoid pronouns such as “we”.
# Add citation after “.. proposed by Phillip Wolfe in 1969.”
# Figure 1 is between two sections. Please fix this issue.
* At least one numerical example:
# Add some space between iterations or subsection break
* A section to discuss and/or illustrate the applications:
# Too few references in this section.
# Last paragraph makes some claims without references.
* A conclusion section
* References
# References should be properly formatted. Refer to the link below for an example: [[Quantum computing for optimization|https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization]]
# More references should be added. A simple Google Scholar search would give you many references.
== [[Piecewise linear approximation|Piecewise Linear Approximation]]==
* Author list
* An introduction of the topic
# The content of this section is good, but there are some issues with sentence clarity and some other grammatical errors. Please revisit this section and make changes accordingly.
* Theory, methodology, and/or algorithmic discussions
# Fix typo “to force the x’ values become associated with”.
* At least one numerical example
* A section to discuss and/or illustrate the applications
# Please aim for a maximum average sentence length of ~25 words. Some of these longer sentences are hard to read.
* A conclusion section
# Expand the conclusion section to be longer than one sentence. The conclusion section to include a brief summary of what was discussed above, an emphasis on it’s significance, and a brief discussion of future extensions and research direction if applicable.
* References
# Include hyperlinks to sources when possible.
== [[Mathematical programming with equilibrium constraints|Mathematical Programming with Equilibrium constraints]] ==
* An introduction of the topic
* Theory, methodology, and/or algorithmic discussions
* At least one numerical example
* At least one numerical example
* A section to discuss and/or illustrate the applications
# Fix typo “while minimize” to “while minimizing”.
* A conclusion section
==[[Line search methods|Line Search Method]]==
* References
 
== [[Wing shape optimization|Wing shape Optimization]] ==
 
* Author list: Remove cornell ID
* Sections: Section titles should not be "bold". Please double check using source editor to avoid weird format of the TOC. Any formatting issue will incur a penalty in the grading.
* An introduction of the topic
# The introduction is missing several references (e.g., “software packages like computational fluid dynamics..”, sentences containing things that aren’t common knowledge, performance claims, etc.)
# Avoid discussion involving finer details of subject methods in this section.
# In the titles, please change the font from bold to normal to have consistent formatting in the site. Same applies to box of content!
* Theory, methodology, and/or algorithmic discussions
* Theory, methodology, and/or algorithmic discussions
# Properly cite the CFD package, don’t just include a link.  
# Avoid pronouns such as “we” (all sections).
# Properly label the figure with a figure number.
==[[Wing shape optimization|Wing shape Optimization]]==
# Consider removing white space between isolated sentences to improve readability.
* At least one numerical example
* At least one numerical example
# If you’ve already defined an abbreviation (CFD), there is no need to define it again. Just use the abbreviation.
# Avoid pronouns such as “we” or “they”.
# Phrases like “under the following” need to be followed by a colon.
# Properly label the figure with a figure number and consider making them larger to improve visibility. Call the reader's attention to the figures in text by referencing the figure number.
# “As seen in the video below” is stated yet there are only images present and it may be initially unclear to the reader which figure is being referenced here.
# Avoid inserting inline citations like “[4] introduces an..”  as it is a bit informal when you don’t explicitly name the subject.
# Don’t just cite the reference when discussing the problem formulation, explicitly write the model formulation and solution process using LaTex or equation visual editor.
# Your team should ideally create a numerical example independently. If you take a numerical example directly from a textbook, etc., you will need to get explicit permission from the author in writing and share that written permission with me.
# A numerical example is simply "numerical" and does not need any application context (similar to those numerical problems in HW assignments). There is an Application section where you discuss the applications.
# A numerical example is simply "numerical" and does not need any application context (similar to those numerical problems in HW assignments). There is an Application section where you discuss the applications.
# The Numerical Example section needs a "step-by-step" calculation process and a clear presentation of each step's results. (again, similar to the way of solving an HW problem).
* A section to discuss and/or illustrate the applications
# Some characters are randomly capitalized in this section.
* A conclusion section
* A conclusion section
# These variables should be defined before the conclusion section, they are out of place here. Also, please use normal text when explaining variables except for the variable symbol.  
# These variables should be defined before the conclusion section, they are out of place here.  
* References
* References
# Include hyperlinks to references if possible. Please consider having the references appear as in this Wiki template, [[Quantum computing for optimization|https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization]]
# Include hyperlinks to references if possible.


== [[Interior-point method for NLP|Interior point method for NLP]] ==
== [[Interior-point method for NLP|Interior point method for NLP]] ==


* Theory, methodology, and/or algorithmic discussions
* Theory, methodology, and/or algorithmic discussions
** Need discussion about the concept of “central path” and the notion of self concordance
# Need discussion about the concept of “central path” and the notion of self concordance
** Please consider proper formatting of the algorithm as pseudocode. Algorithms also must be accompanied with high level summary and discussion on its most important high level ideas.
# Please consider proper formatting of the algorithm as pseudocode. Algorithms also must be accompanied with high level summary and discussion on its most important high level ideas.
** Fix typo “optimisation”.
# Fix typo “optimisation”.
== [[AdaGrad|Adagrad]] ==
* At least one numerical example
# In the first sentence, “..take the following numerical example” should be followed by a colon.
* A section to discuss and/or illustrate the applications
# This section is too short; include specific applications in which input features are sparse and Adagrad excels.
*
* References
 
# References not properly formatted
 
== [[McCormick envelopes|McCormick Envelopes]] ==
 
* Author list
* Sections
* An introduction of the topic


==[[McCormick envelopes|McCormick Envelopes]]==
* Theory, methodology, and/or algorithmic discussions
* Theory, methodology, and/or algorithmic discussions
# References are not linked or expressed correctly. Please consider having the references as this Wiki template, [[Quantum computing for optimization|https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization]]
# References are not linked or expressed correctly. Please consider having the references as this Wiki template, [[Quantum computing for optimization|https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization]]
Line 376: Line 105:
# Please add a few sentences to show the transition from problem to solution.  
# Please add a few sentences to show the transition from problem to solution.  
# The solution technique should be clearly presented, and solved "step-by-step".
# The solution technique should be clearly presented, and solved "step-by-step".
* A section to discuss and/or illustrate the applications
* A conclusion section:
* References
* References
# Please follow the standard reference style - the current format is incorrect.
# Please follow the standard reference style - the current format is incorrect.


== [[Branch and bound (BB) for MINLP|Branch and Bound for MINLP]] ==
== [[Branch and bound (BB) for MINLP|Branch and Bound for MINLP]] ==
* Author list:
* An introduction of the topic
* Theory, methodology, and/or algorithmic discussions


* At least one numerical example
* At least one numerical example
Line 393: Line 115:


# This example does not follow the MINLP structure discussed in the above section since binary variables are missing. Branch and bound may not be appropriate for such problems. Please provide an appropriate numerical example and solve it according to the above comments.
# This example does not follow the MINLP structure discussed in the above section since binary variables are missing. Branch and bound may not be appropriate for such problems. Please provide an appropriate numerical example and solve it according to the above comments.
* A section to discuss and/or illustrate the applications
* A conclusion section:


* References
* References
# Too few references overall, you should aggregate information from multiple sources. A quick Google scholar search could provide relevant references.
# Too few references overall, you should aggregate information from multiple sources. A quick Google scholar search could provide relevant references.
# Please follow the standard reference style - the current format is incorrect.
# Please follow the standard reference style - the current format is incorrect

Latest revision as of 16:52, 21 December 2021

Lagrangian duality

  • Theory, methodology, and/or algorithmic discussions
  1. The Lagrangian variables associated with equality constraints h(x) are unbounded but the Lagrangian dual problem states them as non-negative. Please fix the same.
  • At least one numerical example
  1. Please update the dual objective function and domain of dual variables accordingly.

Stochastic Programming

  • An introduction of the topic
  1. Place references after the period at the end of each sentence. This goes for all the sections in the wiki.
  • Theory, methodology, and/or algorithmic discussions
  1. The inline notations (`x1`, `s1`) should also be typed using LaTex.

Portfolio Optimization

  • Theory, methodology, and/or algorithmic discussions
  1. Rephrase “Cut the relevant information and conditions in the portfolio optimization, as well as the final requirements into the relevant variables, constraints and linear functions of the linear programming problem.”
  • At least one numerical example
  1. Fix misspelling “dolling decision variables”.
  • A conclusion section
  1. Need some commas here (second sentence hard to read).
  • References
  1. Remove white space between end of sentences and reference numbers.

Chance constraint method

  • Theory, methodology, and/or algorithmic discussions
  1. Some normal text was expressed as equation.

Bayesian Optimization

  • Theory, methodology, and/or algorithmic discussions
  1. Acquisition function figure could be made larger and clearer to improve readability.
  • References
  1. References should be properly formatted, not just hyperlinks. Refer to the link below for an example: https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization (#2 is still incorrectly formatt

Conjugate gradient methods

  • Theory, methodology, and/or algorithmic discussions
  1. All equations need to be better formatted.
  2. Please properly format pseudocode.
  • A conclusion section
  1. Consider adding future research directions

Adam

  • Theory, methodology, and/or algorithmic discussions
  1. Avoid inserting inline citations after words like “This article..” as it is a bit informal. This could be rephrased or changed to something like “According to author,^[2] …” with author name inserted.

a* algorithm

  • An introduction of the topic:
  1. Please consider correcting a few grammatical errors: “Optimal path”, “cross country”, missing period at end of first paragraph, other random capitalizations, etc.
  2. There are no citations in the introduction. Please cite every source.
  • Theory, methodology, and/or algorithmic discussions
  1. Please add the mathematical description of the algorithm. (Insufficient)
  2. Please fix grammatical and spelling errors as (“from current position to the goal”, “There are a lot of discussions”, etc). Also, many hyphens are missing as “non playable”.
  • At least one numerical example
  1. The numerical example does not show the full computations the algorithm performs. Please show the computation on a smaller example.

Job-Shop Scheduling Problem

  • Theory, methodology, and/or algorithmic discussions
  1. Since this Wiki focuses on jobshop scheduling, at least two methods are expected. Branch and bound is a general MILP technique, so, it is recommended to add a tailored technique that can only solve specific jobshop scheduling problems. Solving the numerical example with this technique is not necessary.

Optimization in game theory

  • Theory, methodology, and/or algorithmic discussions
  1. Add a mathematical description of the problem and a pseudocode/flowchart for the Lemke-Howson algorithm.  
  2. Rephrase “This algorithm utilizes iterated pivoting much like the simplex algorithm used in the simplex algorithm used in linear programming”.
  3. Formatting (incomplete).
  • References
  1. Incorrect reference style.

Trust-region methods

  • An introduction of the topic
  1. Avoid pronouns such as “we”. This goes for all other sections as well.
  • Theory, methodology, and/or algorithmic discussions
  1. Organization of ideas in this section needs work.
  2. Please format the algorithm in proper algorithmic pseudocode format.

Outer-approximation

  • Theory, methodology, and/or algorithmic discussions
  1. “Minimize” and “subject to” should be “min” and “s.t.” in MathType (inconsistent formatting)

Unit commitment problem

  • At least one numerical example
  1. Fix typo “while minimize” to “while minimizing”.

Line Search Method

  • Theory, methodology, and/or algorithmic discussions
  1. Avoid pronouns such as “we” (all sections).

Wing shape Optimization

  • At least one numerical example
  1. A numerical example is simply "numerical" and does not need any application context (similar to those numerical problems in HW assignments). There is an Application section where you discuss the applications.
  • A conclusion section
  1. These variables should be defined before the conclusion section, they are out of place here.
  • References
  1. Include hyperlinks to references if possible.

Interior point method for NLP

  • Theory, methodology, and/or algorithmic discussions
  1. Need discussion about the concept of “central path” and the notion of self concordance
  2. Please consider proper formatting of the algorithm as pseudocode. Algorithms also must be accompanied with high level summary and discussion on its most important high level ideas.
  3. Fix typo “optimisation”.

McCormick Envelopes

  • Theory, methodology, and/or algorithmic discussions
  1. References are not linked or expressed correctly. Please consider having the references as this Wiki template, https://optimization.cbe.cornell.edu/index.php?title=Quantum_computing_for_optimization
  • At least one numerical example
  1. Please add a few sentences to show the transition from problem to solution.
  2. The solution technique should be clearly presented, and solved "step-by-step".
  • References
  1. Please follow the standard reference style - the current format is incorrect.

Branch and Bound for MINLP

  • At least one numerical example
  1. Please show a step-by-step solution in the example. The solution is incomplete. The Numerical Example section needs a "step-by-step" calculation process and a clear presentation of each step's results. (again, similar to the way of solving an HW problem).
  1. This example does not follow the MINLP structure discussed in the above section since binary variables are missing. Branch and bound may not be appropriate for such problems. Please provide an appropriate numerical example and solve it according to the above comments.
  • References
  1. Too few references overall, you should aggregate information from multiple sources. A quick Google scholar search could provide relevant references.
  2. Please follow the standard reference style - the current format is incorrect
Retrieved from "https://optimization.cbe.cornell.edu/index.php?title=2021_Cornell_Optimization_Open_Textbook_Feedback&oldid=6565"