2021 Cornell Optimization Open Textbook Feedback: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| (13 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
== [[Lagrangean duality|Lagrangian duality]] == | == [[Lagrangean duality|Lagrangian duality]] == | ||
* 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. | ||
==[[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 inline notations (`x1`, `s1`) should also be typed using LaTex. | |||
==[[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 conclusion section | * A conclusion section | ||
# Need some commas here (second sentence hard to read). | # Need some commas here (second sentence hard to read). | ||
| Line 66: | Line 22: | ||
== [[Chance-constraint method|Chance constraint method]] == | == [[Chance-constraint method|Chance constraint method]] == | ||
* 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. | ||
== [[Bayesian Optimization]] == | == [[Bayesian Optimization]] == | ||
* Theory, methodology, and/or algorithmic discussions | * Theory, methodology, and/or algorithmic discussions | ||
# Acquisition function figure could be made larger and clearer to improve readability. | # Acquisition function figure could be made larger and clearer to improve readability. | ||
* 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]] == | ||
| Line 99: | Line 37: | ||
* A conclusion section | * A conclusion section | ||
# Consider adding future research directions | # Consider adding future research directions | ||
==[[Adam]]== | |||
== [[Adam]] == | |||
* 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. | ||
== [[A-star algorithm|a* algorithm]] == | == [[A-star algorithm|a* algorithm]] == | ||
* 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 139: | 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. | ||
== [[Job shop scheduling|Job-Shop Scheduling Problem]] == | == [[Job shop scheduling|Job-Shop Scheduling Problem]] == | ||
* 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. | ||
== [[Optimization in game theory]] == | == [[Optimization in game theory]] == | ||
* Theory, methodology, and/or algorithmic discussions | * Theory, methodology, and/or algorithmic discussions | ||
| Line 164: | 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). | ||
* References | * References | ||
# Incorrect reference style. | # Incorrect reference style. | ||
| Line 175: | 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. | |||
* 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. | ||
# Please format the algorithm in proper algorithmic pseudocode format. | # Please format the algorithm in proper algorithmic pseudocode format. | ||
==[[Outer-approximation (OA)|Outer-approximation]]== | |||
* Theory, methodology, and/or algorithmic discussions | * Theory, methodology, and/or algorithmic discussions | ||
# “Minimize” and “subject to” should be “min” and “s.t.” in MathType (inconsistent formatting) | # “Minimize” and “subject to” should be “min” and “s.t.” in MathType (inconsistent formatting) | ||
== [[Unit commitment problem]] == | == [[Unit commitment problem]] == | ||
* At least one numerical example | * At least one numerical example | ||
# Fix typo “while minimize” to “while minimizing”. | # Fix typo “while minimize” to “while minimizing”. | ||
==[[Line search methods|Line Search Method]]== | |||
== [[Line search methods|Line Search Method]] == | |||
* Theory, methodology, and/or algorithmic discussions | * Theory, methodology, and/or algorithmic discussions | ||
# Avoid pronouns such as “we” (all sections). | # Avoid pronouns such as “we” (all sections). | ||
==[[Wing shape optimization|Wing shape Optimization]]== | |||
== [[Wing shape optimization|Wing shape Optimization]] == | |||
* At least one numerical example | * At least one numerical example | ||
# 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. | ||
* A conclusion section | * A conclusion section | ||
# These variables should be defined before the conclusion section, they are out of place here. | # These variables should be defined before the conclusion section, they are out of place here. | ||
| Line 291: | Line 95: | ||
* 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 | |||
# 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”. | |||
==[[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 315: | 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". | ||
* 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]] == | ||
* At least one numerical example | * At least one numerical example | ||
| Line 332: | 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. | ||
* 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
- 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
- Please update the dual objective function and domain of dual variables accordingly.
Stochastic Programming
- 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.
- Theory, methodology, and/or algorithmic discussions
- The inline notations (`x1`, `s1`) should also be typed using LaTex.
Portfolio Optimization
- 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.”
- At least one numerical example
- Fix misspelling “dolling decision variables”.
- A conclusion section
- Need some commas here (second sentence hard to read).
- References
- Remove white space between end of sentences and reference numbers.
Chance constraint method
- Theory, methodology, and/or algorithmic discussions
- Some normal text was expressed as equation.
Bayesian Optimization
- Theory, methodology, and/or algorithmic discussions
- Acquisition function figure could be made larger and clearer to improve readability.
- References
- 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
- All equations need to be better formatted.
- Please properly format pseudocode.
- A conclusion section
- Consider adding future research directions
Adam
- 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.
a* algorithm
- 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.
- There are no citations in the introduction. Please cite every source.
- Theory, methodology, and/or algorithmic discussions
- Please add the mathematical description of the algorithm. (Insufficient)
- 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
- 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
- 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
- Add a mathematical description of the problem and a pseudocode/flowchart for the Lemke-Howson algorithm.
- Rephrase “This algorithm utilizes iterated pivoting much like the simplex algorithm used in the simplex algorithm used in linear programming”.
- Formatting (incomplete).
- References
- Incorrect reference style.
Trust-region methods
- An introduction of the topic
- Avoid pronouns such as “we”. This goes for all other sections as well.
- Theory, methodology, and/or algorithmic discussions
- Organization of ideas in this section needs work.
- Please format the algorithm in proper algorithmic pseudocode format.
Outer-approximation
- Theory, methodology, and/or algorithmic discussions
- “Minimize” and “subject to” should be “min” and “s.t.” in MathType (inconsistent formatting)
Unit commitment problem
- At least one numerical example
- Fix typo “while minimize” to “while minimizing”.
Line Search Method
- Theory, methodology, and/or algorithmic discussions
- Avoid pronouns such as “we” (all sections).
Wing shape Optimization
- At least one numerical example
- 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
- These variables should be defined before the conclusion section, they are out of place here.
- References
- Include hyperlinks to references if possible.
Interior point method for NLP
- Theory, methodology, and/or algorithmic discussions
- 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.
- Fix typo “optimisation”.
McCormick Envelopes
- Theory, methodology, and/or algorithmic discussions
- 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
- 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".
- References
- Please follow the standard reference style - the current format is incorrect.
Branch and Bound for MINLP
- At least one numerical example
- 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).
- 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
- 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