|
|
| (32 intermediate revisions by 4 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
| |
| # The current introduction to the jobshop scheduling problem has only two sentences in addition to the parameter description. Introduction typically contains information about the problem, its importance in the real-world, and some information about the solution techniques and their types to solve the problem. Please add some information that covers the above.
| |
| * Theory, methodology, and/or algorithmic discussions | | * Theory, methodology, and/or algorithmic discussions |
| # It is unclear whether the assumptions stated in this section are required to apply the following solution techniques. Please clarify the same. Also use complete sentences to state them.
| | |
| # The branch and bounds method described in this section only discusses the solution technique for problems with one machines. However, branch and bound is a general technique that can be applied to any MILP problems with varying scales. Please update the “methods” section to be as general as possible.
| |
| # 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. |
| # Reference to the branch and bound technique described in this section is a “youtube” video. Please add references in literature that describe this method in detail. The method used in this video is highly tailored for a single machine application. This is also an incorrect way to cite a reference. Please keep this section as general as possible.
| |
| # Use LaTex code or equation editor to display all equations and variables in this section and all other sections as well.
| |
| # Check grammar in this section. For example, phrases like “are as follows” need to be followed by a colon and not a period.
| |
| # Consider rewriting the assumptions as a list in this section.
| |
| * At least one numerical example
| |
| # Every iteration should be clearly presented, and solved "step-by-step".
| |
| # The example used in this section is exactly the same as the one in the youtube video. Please use a modification of this example or choose another example/method to demonstrate the solution technique. Your team should ideally create a numerical example independently. If you take a numerical example directly from a particular source, you will need to get explicit permission from the textbook author in writing and share that written permission with the instructors.
| |
| # The figure in this section is not numbered when all others are. Relabel this figure for consistency and its number to refer to it in-text.
| |
| # A numerical example should be simply "numerical" and does not need any application context (similar to those numerical problems in HW assignments).
| |
| * A section to discuss and/or illustrate the applications
| |
| # This section should only focus on real-world applications of the jobshop scheduling problem. But currently, this section includes additional information on solution techniques/complexity that is appropriate for the Introduction section. Please discuss the applications of the problem in this section.
| |
| * A conclusion section
| |
| # The meaning of “Operations applications” is unclear. Please explain or update if necessary.
| |
| # The current conclusion section does not properly summarize the problem. Please refer to other Wiki examples for an idea to update the section accordingly.
| |
| * 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]]
| |
| # Please reference media sources like reference 5 appropriately.
| |
| # A simple Google Scholar search would give you many "formal" 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 185: |
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
| |
| # Please add more summarizing especially from theory sentences and avoid long sentences.
| |
| * References | | * References |
| # Incorrect reference style. | | # Incorrect reference style. |
| Line 196: |
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.
| | ==[[Outer-approximation (OA)|Outer-approximation]]== |
| | |
| == [[Momentum]] == | |
| * An introduction of the topic
| |
| # Apart from an explanation on momentum, it is necessary to briefly point out the limitations of SGD and why momentum could help with these limitations. Please update it accordingly.
| |
| # Remove bold on “Momentum”.
| |
| # 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 |
| #
| | # “Minimize” and “subject to” should be “min” and “s.t.” in MathType (inconsistent formatting) |
| # The definition of the update rule for SGD with momentum looks incorrect, specifically the first expression. Please fix it and also explain all the parameters used.
| |
| # Use LaTex code or equation editor to display all equations and variables (e.g., “W”, “V`”, etc.) in this section and all other sections as well.
| |
| # Avoid pronouns such as “you”.
| |
| * At least one numerical example
| |
| # Every iteration should be clearly presented, and solved "step-by-step". Since writing all iterations is not feasible, at least present a few iterations for both cases.
| |
| # Please try to label the plots that explains what each line color means.
| |
| # Starting point for SGD with momentum is different in explanation and the table. Please fix the same.
| |
| * A section to discuss and/or illustrate the applications
| |
| # Please use correct terminology like “optimizing non-convex functions” and not “training non-convex models”.
| |
| * References
| |
| # Almost all references used are URLs. Please try to add journal/conference articles or books for references, instead of directly citing the URLs. Please check the list below and run a quick Google (Scholar) search to identify relevant literature.
| |
| | |
| == [[Stochastic dynamic programming|Stochastic Dynamic programming]] ==
| |
| | |
| * Author list
| |
| # Remove cornell ID
| |
| * An introduction of the topic
| |
| # Discussion on applications should be moved to a separate section.
| |
| * Theory, methodology, and/or algorithmic discussions
| |
| # Remove the grey box background of equations.
| |
| * At least one numerical example
| |
| * A section to discuss and/or illustrate the applications
| |
| * A conclusion section
| |
| * 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]]
| |
| | |
| == [[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 | | * At least one numerical example |
| # Every iteration should be clearly presented, and solved "step-by-step".
| | # Fix typo “while minimize” to “while minimizing”. |
| # Label the figures in this section properly with figure numbers.
| | ==[[Line search methods|Line Search Method]]== |
| # 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
| |
| # I suggest highlighting disadvantages along with advantages.
| |
| * Theory, methodology, and/or algorithmic discussions | | * Theory, methodology, and/or algorithmic discussions |
| # “[n x 1] matrix” please use the equation editor to express mathematical descriptions and symbols (p,b, etc) | | # Avoid pronouns such as “we” (all sections). |
| | ==[[Wing shape optimization|Wing shape Optimization]]== |
| * At least one numerical example | | * At least one numerical example |
| # Every iteration should be clearly presented, and solved "step-by-step".
| |
| # Please show at least a few iterations. Even for smaller examples if needed. Report the final solution.
| |
| # Please use the LaTex code or equation editor for min and include s.t., etc.
| |
| # Please ensure that the example : (1) is NOT directly taken from a book, and (2) a step-by-step solution should be provided, showing every intermediate steps. For your example, please explicitly state that the derivative is taken etc.
| |
| * A section to discuss and/or illustrate the applications:
| |
| * A conclusion section
| |
| # Same as the introduction. Pros and cons should be evaluated together!
| |
| * 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]]
| |
|
| |
| == [[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
| |
| # This section includes several terms like variational inequalities, constraint qualifications that were not discussed in the class. Please add a sentence to explain them before using them.
| |
| * Theory, methodology, and/or algorithmic discussions
| |
| # The meaning of parameter vector x is unclear. Please add more information or update if necessary.
| |
| # Equations and symbols in the PIPA subsection are not formatted correctly. Please use the same formatting for all equations, so they read as mathematical equations and not text. This goes for all other sections as well.
| |
| # Use equations instead of images to represent math programs and equations in the Implicit Descent and SQP subsection.
| |
| # Apart from the steps for each solution technique, please also add a few sentences that describe each method.
| |
| * At least one numerical example
| |
| # Please define the terms like NCP, MP before abbreviating them. Also try not to unnecessarily abbreviate simple terms.
| |
| # Equations should be typed by LaTex. Images for equations are unacceptable.
| |
| # GAMS code is strongly discouraged. Please solve the problem "step-by-step".
| |
| # The selected numerical example is fine but is directly solved with the MPEC solver in GAMS. Try to solve it manually like the homework/in-class problems step by step using the steps described in the previous section by choosing any of the methods.
| |
| # Avoid using figures in the equations (subject to etc)
| |
| * A section to discuss and/or illustrate the applications
| |
| # Add references to “power management, highway pricing, chemical process engineering, and traffic planning.”
| |
| * A conclusion section
| |
| * 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]]
| |
| # This Wiki contains very few references. Please check the list below and run a quick Google (Scholar) search to identify relevant literature.
| |
|
| |
| == [[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
| |
| # Properly cite the CFD package, don’t just include a link.
| |
| # Properly label the figure with a figure number.
| |
| # Consider removing white space between isolated sentences to improve readability.
| |
| * 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: OK but I suggest removing NetID
| | ==[[McCormick envelopes|McCormick Envelopes]]== |
| * Sections: Section titles should not be "bold". Please double check using source editor to avoid weird format of the TOC.
| |
| * An introduction of the topic
| |
| # First sentence is hard to read. Please consider keeping sentences below 25-30 words.
| |
| # No references provided. Please cite all sources.
| |
| # Figure 1 is provided in the middle between two sections. Please include in the introduction section.
| |
| * 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]] |
| # When using mathematical expressions and symbols, please use the equation editor. (e.g., x*y, exy + y, sin (x+y) - x2)
| |
| * At least one numerical example | | * At least one numerical example |
| # 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". |
| # GAMS code is unnecessary. Please provide detailed step-by-step calculation results.
| |
| * A section to discuss and/or illustrate the applications
| |
| # Having a list is not enough. Please explain at least three applications in a few sentences each.
| |
| # This section should be at least a paragraph to discuss relevant applications. Each application should be explicitly linked to the page topic. A few keywords do not meet the requirement at all.
| |
| * A conclusion section:
| |
| * References | | * References |
| # References are not 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]]
| |
| # 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:
| |
| ** Remove NetIDS
| |
| ** Please remove abbreviations from the title (i.e. BB).
| |
| * Sections: Section titles should not be "bold". Please double check using source editor to avoid weird format of the TOC.
| |
| * An introduction of the topic
| |
| # Please cite sources appropriately: 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]]
| |
| # Introduction is very short for a well-recognized topic. Please expand significantly. You may refer to the Wiki examples to get an idea on writing the Introduction to a topic.
| |
| # An illustration might be useful here.
| |
| * Theory, methodology, and/or algorithmic discussions
| |
| # The algorithm described here considers only binary integer variables. However, MINLP problems may include non-binary integer variables too. Please update the method or provide a short description of the assumptions that the MINLP problem needs to satisfy in order for the presented technique to be applicable.
| |
| # Use linked citations please as the Wiki template above.
| |
| # Please provide steps in a more organized way. 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.
| |
| # Step 2 is missing yet it is referenced in the text multiple times. Please address this in addition to the above comment.
| |
| # An illustration might be useful here as well.
| |
| # Please explain what a Gomory Cut is. If the topic is available on optimization.cb.cornell.edu, you can link it.
| |
| # The current equations seem to be simple text written in Italics. All mathematical symbols and equations should be formatted via LaTex.
| |
| # Please format the math programs with equations and notations using formulations in lecture notes as templates.
| |
| * At least one numerical example | | * At least one numerical example |
| # Please add a few sentences to show the transition from problem to solution.
| | |
| # 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). | | # 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). |
| # Please use the equation editor for equations or mathematical symbols. - All mathematical symbols and equations should be formatted via LaTex - this is a learning objective of the Wiki assignment. You can find some useful links on converting your equations/symbols into LaTex code here: (<nowiki>https://optimization.cbe.cornell.edu/index.php?title=Help:Contents</nowiki>). Again, any formatting issue will incur a "compound" penalty in the grading.
| | |
| # 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. |
| # Make sure your example is not taken from a book as that is strictly disallowed.
| | |
| * A section to discuss and/or illustrate the applications
| |
| # This section is not well-formatted. Please provide 3 applications and explain each in a few sentences and how BB for MINLP could be used. Also, please eliminate having multiple sections (Application, Mathematical problem, industrial application). All these could be merged together.
| |
| # This section should be at least a paragraph to discuss relevant applications. Each application should be explicitly linked to the page topic. A few keywords do not meet the requirement at all.
| |
| * A conclusion section:
| |
| # The sentence is hard to understand "a scheme that grows exponentially because" please use a simple language. Is it also theoretically correct? It is also not mentioned and explained earlier. Thus, please avoid introducing new concepts or terms at the end.
| |
| # Please use summarizing sentences to describe earlier sections instead of introducing new concepts/discussion.
| |
| * 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. |
| # References are not 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]]
| | # Please follow the standard reference style - the current format is incorrect |
| # Please follow the standard reference style - the current format is incorrect. | |