2024 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
No edit summary
 
(23 intermediate revisions by 2 users not shown)
Line 1: Line 1:
== [[Computational complexity]] ==
== [[Computational complexity]] ==
*"Problems in this class are efficiently solvable, however, the time required to solve grows polynomially with the size of input" Please revise the use of however in the rest of the file.
*References were not provided to support applications on computer science and quantum computing.
*Put the citation number within the punctuation. Please revise this problem for the rest of the file.
*Please pay attention to use proper punctuations. For example, add commas before and behind the cited paper title will improve the clarity of the sentence. Please also revise this issue for the rest of the file.
*"The smaller the value of this function, the higher the efficiency of the algorithm. "
*The example 1 has some grammar issue.
*This is topic-specific suggestion:
*Please try to come up with one example of computational complexity and give the procedure of how to reduce its complexity while retaining the solution quality.
*When stating potential applications, please provide related references.
*The provided numerical is somewhat trivial. You may try a more sophisticated example (e.g., comparing the different sorting algorithms).


== [[Heuristic algorithms]] ==
== [[Heuristic algorithms]] ==
*Adding more details to the Application Section is recommended.
*Please use FigureX as a reference in the text.
*Avoid using contraction (e.g., there's) in scientific writing.


== [[Local branching]] ==
== [[Local branching]] ==
*If the "Local Branching " is preferedly used in the text, please revise the other typo like "local branching".
*The title should be “Problem Solution” instead of ”Problem Resolution“.
*Please explain every variable/parameters used in the equations.
*The added figure is too small for viewing from the main page and also lacks captions and explanations.
*It may be good to generate a table or figure to summarize the results of the numerical examples.
*There are still some formatting issues with the subtitles. For example, some are in bold form while others are not in the content.
*Page 5: "Local Branching is a powerful optimization strategy when it comes to solving MILP optimization problems. Its main applications lie in industries such as logistics, manufacturing, energy, data science and engineering for problems such as scheduling, production planning, nesting and transportation logistics where decision-makers look for high-quality solutions within reasonable computational times. " This sentence looks a little strange. Please revise it.
*It would be better to provide more references to support the statements in the Application Section.
*Please pay attention to the citation format. A link only may not be sufficient. Please refer to our examples for improve it.
*Please try to come up with flowchart/pseudocode for demonstrating the steps.
*Please replace Step 1, 2, 3 with correct subheadings in Application section.
*Websites and Youtube often are not proper citation sources.


== [[Trust-region methods]] ==
== [[Trust-region methods]] ==
*For the applications section, a better method is to briefly summarize the advantages of the method in multiple areas, instead of presents its application on two very specific cases.
*Please label the figures with numbers and direct readers to the figures in text.
*Please try to update equations on page 5.
*References were not well formatted (e.g., Yuan, Y. (2015b)).
*Please try to use the pseudocode for the procedure described on page 3.
 
*m_k and p in eq.(1) are not defined.
*Fix the typo “prediced reduction” in eq.(3).
*Avoid using contraction (e.g., it’s, doesn’t) and pronouns (e.g., we, us) in scientific writing.
*Rewrite the sentence, “Identical to line search, we do not need to compute the algorithm (2)” as (2) itself is not an algorithm.
*The termination conditions are not complete in section “Termination Criteria”.
*Fletcher is not the same author as cited in [5].
== [[Quadratic programming]] ==
== [[Quadratic programming]] ==
*"Quadratic programming problems typically are formatted as minimization problems, and the general mathematical formulation is "
*An inappropriate nonconvex example was used in the Wiki Page. The problem is an MIQP problem instead of a single QP problem.
*"For convex problems, Q defined in the equation above must be positive semi-definite; if not, there may be multiple local solutions meeting minimization criteria and deemed non-convex."
*Some symbols used in the pseudocodes still lack explanation.
*"Active set methods are best suited for most linear programming problems, particularly those with manageable dimensions, as they exploit the problem's structure and update estimates of active constraints iteratively. "
*it would be better to provide definitions of all parameters/variables used in the pseudocode.
*same pseudocode problem
*"Constraints that are box defined or inequalities that are convex, are critical for the gradient projection method to be executed efficiently. Note, the box defined constraints in this instance will define our feasibility region and referred to as the box" This text is a little strange to read, please revise it.
*Insert picture as equation is ok for now, but be sure to use the equation form when do it on the Wiki page.
*In Wiki editing, step-by-step calculation process is not necessary. It may be better to keep the brevity of the solution process.
*"Markowitz reviewed a return projection of a given stock based on historical data, then analyzed variances from historical projections based on realized returns to generate the risk"
*"This problem has proven to be beneficial in optimizing the cargo loads and establishing transportation routes.
*"An optimized power management program is critical for the plug-in hybrid electric vehicles (PHEV) to operate efficiently. The power management problem is more complex in PHEVs than traditional hybrid vehicles and purely electric vehicles as it relies on grid charged batteries as the for its initial range, then drives like HEVs alternating between fuel and charge obtained during the combustion of the fuel. The power management problem can be described as a quadratic polynomial and solved with quadratic programing with the optimization goal to minimize fuel consumption.15" Please check the grammar of the texts above.
*"GAMS Gurobi suite contains several algorithms that are suitable for quadratic programming"
*check the grammer of the conclusion texts.
*Please provide one example of non convex QP problem.
 
== [[Sequential quadratic programming]] ==


== [[Subgradient optimization]] ==
== [[Subgradient optimization]] ==
*"Developed in the Soviet Union during the 1960s and 70s, primarily by Naum Z. Shor" a citation may be needed here.
*References were not well formatted.
*"While similar in approach as the gradient methods for differentiable functions, there are several key differences. " This sentence reads a little bit strange. Please check the grammer for the entire file.
*Symbols used in equations lack explanations.
*Please revise the use of punctuations in your file. For example, a comma should be added in the sentence of "As stated in the introduction the step size for this algorithm is determined externally to the algorithm itself"
*The application section was not well drafted and supported by references.
*Clear explanations are needed to present the meaning of all parameters/variables used in equations.
*The table would be better by being transposed.
*Please provide more references to support the statements in the Application Section.
*Please include the pseudocode for your algorithm.
*Raw data takes too much space in the current form. Please consider transposing it or find other ways to solve this issue.
*Wikipedia is not a proper citation source. Please avoid citing Wikipedia.
 
== [[Dynamic optimization]] ==


== [[Eight step procedures]] ==
*For the algorithm description, it would be better to have a pseudocode or a flow chart to summarize it.
*Please use Latex equation editor for equations.
*Please number and label all figures and tables, use FigureX, TableX as a reference in the text.
*Please place references after the period at the end of each sentence and avoid after the optimization problems. This goes for all the sections in the wiki.
== [[Nondifferentiable Optimization]] ==
== [[Nondifferentiable Optimization]] ==
*Most contents are from previous year. The Wiki page should be your original content.
*It is also recommended to revise the citation format based on our example files.
*Please add the case of non convex functions.
*Please add references to support the content in the Introduction section. In-text citations are required.
*Please use Latex equation editor for typing symbols and equations.
*The Numerical Example section is incomplete.
*Application and Conclusion sections are missing.


== [[Evolutionary multimodal optimization]] ==
== [[Evolutionary multimodal optimization]] ==
*Please include more citations in Algorithm Discussion section to support the contents.
*Please use FigureX as a reference in the text.


== [[Stackelberg leadership model]] ==
== [[Stackelberg leadership model]] ==
*Please make citations immediately after the citing contents. Please double-check all the citations in your file.
*Please include more citations in the application section to support your statements.
*Please use flowchart/pseudocode for representing the steps of algorithm
*Please use flowchart/pseudocode for representing the steps of algorithm
*Check the consistency of abbreviations (e.g. what is PAWS?)
*Check the consistency of abbreviations (e.g. what is PAWS?)
*Sections 5-7 can be combined into one section and divided by subsections.


== [[Quadratic constrained quadratic programming]] ==
== [[Quadratic constrained quadratic programming]] ==
*Please double-check that all cited Figures are clearly attached with citations.
*Form of in-text citation is not proper
*Please double-check the citations of your references.
*Need significant amount of citation to support the statement
*Mentioned the ways to relax the non convex set, so please provide at least one example either from SDP or RLT.
*Double check with abbreviations (e.g. KKT and SDP should be defined at the beginning sections)
*Equations should be written in a formal way (e.g. 1/2 should be 1 on top and 2 on the bottom)
*Abbreviations should be introduced only once throughout all sections (e.g., QCQP, QP, SDP)
*Abbreviations should be introduced only once throughout all sections (e.g., QCQP, QP, SDP)
*Avoid using pronouns (e.g., we) in scientific writing.
*Avoid using pronouns (e.g., we) in scientific writing.
*Please revise “Ex. Objective” and “Ex. Constraint” parts in a more professional way in the Application section.


== [[Derivative free optimization]] ==
== [[Derivative free optimization]] ==
*Please avoid the use of the term like "you" or "we" in the Wiki file.
*Please include more citations to support your statements in the application section.
*Please add more citations to support your statement in the introduction section
*Please try to include a flowchart or pseudocode for illustration of the algorithm.
*Please try to include a flowchart or pseudocode for illustration of the algorithm.
*If DFO is defined in the previous sections, please use such abbreviations consistently (same for other abbreviations).
*If DFO is defined in the previous sections, please use such abbreviations consistently (same for other abbreviations).
*Please add subheadings in the Application section for better readability.


== [[Signomial problems]] ==
== [[Signomial problems]] ==
*There is a lack of numerical examples for illustrating the global optimization method introduced on the Wiki page.
*The clarification of the equations used in the Introduction section needs to be improved.


== [[Adadelta]] ==
== [[Adadelta]] ==
*There is an extra line of citation links in the References section.


== [[Adafactor]] ==
== [[Adafactor]] ==
*The clarity of the alghrithm and numerical example session needs to be improved. It is convenient to list all equations, but not good to present it to others.
*The clarity of the alghrithm and numerical example session needs to be improved. It is convenient to list all equations, but not good to present it to others.
*Please revise your reference format.
*More citations are needed for supporting your statement.
*More citations are needed for supporting your statement in the introduction section.
*For the section "software tools and platforms" please provide more details, e.g. how PyTorch is using such optimizers and how this platform introduced this algorithm (do not directly copy and remember to add citation if this is not your own idea).
*The sentence "This article mainly introduces Adafactor and its function, algorithm, and application." can be removed.
*Algorithm and theory section is missing.  


== [[AdamW]] ==
== [[AdamW]] ==
*Please double-check if the citations are correctly formatted in the text.
*For the application section, it would be good to emphasize the advantages of AdamW compared to other approach by citing the quantitative results from previous literature.
*For the application section, it would be good to emphasize the advantages of AdamW compared to other approach by citing the quantitative results from previous literature.
*Please provide flowchart/pseudocode for representing your procedure
*Please provide citations for your statement (e.g. how AdamW used in Finance, where is your source)
*Avoid using pronouns (e.g., we, let's) in scientific writing.
*Avoid using pronouns (e.g., we, let's) in scientific writing.
*The code snippet in the Application section can be removed.


== [[Adamax]] ==
== [[Adamax]] ==
*The pseudocode was not well defined. More explanations and logical flow are needed.
*Citations need to be included in the punctuation like period.
*Since this is a modified version of Adam, a comparison with Adam is needed for the numerical example.
*A machine learning case is needed since this is an algorithm designed for machine learning models.


== [[FTRL algorithm]] ==
== [[FTRL algorithm]] ==
*"The FTRL (Follow the Regularized Leader) family of algorithms are fundamental algorithms utilized in online learning and are a type of FTL (Follow the Leader) algorithm, which chooses a weight function at each timestep that minimizes the loss of all previously observed data, but implementations of the FTRL algorithm generally utilize a linearized loss function to reduce computational complexity, with a regularizer preventing the solution from diverging. " This sentence reads a little bit strange. Please revise it.
*It is very difficult to clarify different levels of subtitles based on the text.
*It should be "Google" instead of "google".
*References were not well formatted. For example, "[1]" is added to many references with no meaning.
*It should be "data point" instead of "datapoint".
*Some symbols used in the equation lack explanations.
*Import figure as equation is ok now. But for the real Wiki editing page, it should be done by equation form and should be properly worked with citations if any reference is used.
*Please try to improve the clarity and logic flow of the algorithm description part.
*"Other varieties of regularizers utilize both L1 and L2 loss, generating a stable and sparse solution. They are typically used in place of other gradient descent algorithms such as Objective Constraint Online Gradient Descent (OC-OGD) that induce sparsity into the model. An instance of the FTRL algorithm using both an L1 and L2 regularizers are shown below. " Please revise the grammer of the above texts.
*"The first application that the FTRL algorithm was used for was in(deleted) online advertising by Google"
*It is suggested to include pseudocode for this algorithm.
*Some equations are shown in figure form. Please use Latex equation editor for equations.  
 
== [[Lion algorithm]] ==


== [[LossScaleOptimizer|LossscaleOptimizer]] ==
== [[LossScaleOptimizer|LossscaleOptimizer]] ==
*Provide more citations to support your statements in the Application section?
*More citations are needed for supporting the statement and applications.
*Provide a figure to demonstrate the results generated from the numerical example?
*Please provide more applications
*Please provide the platform which used such algorithms
*The Conclusion section is missing.


== [[Nadam]] ==
== [[Nadam]] ==
*The result figures of the numerical example have not been placed in the proper place.
*The numerical example and application parts are still not representative of illustrating NDAM's performance for machine learning models.


== [[Bayesian optimization|Beyesian optimization]] ==
== [[Bayesian optimization|Beyesian optimization]] ==
*Only suggestion is that providing code may not be appropriate in the Wiki page (all on your decision).
*Citation form (in text) should be double checked.
*Citation number should be double checked.
*You can use abbreviations if some special terms appeared multiple times (e.g. Bayesian Optimization -> BO).
*Avoid using pronouns (e.g., we) in scientific writing.
*There is no need to show your own code in this wiki page.
*Avoid adding citations in the conclusion section


== [[Genetic algorithm]] ==
== [[Genetic algorithm]] ==
*Are the Figures used in the text self-generated or cited? If cited, please add citations. Also the resolution of the figures may need to be improved. Looks like two Figure 1 are included, please fix it.
*Please provide some citations for supporting your statement (e.g. in Introduction)
*Please provide some citations for supporting your statement (e.g. in Introduction)
*Abbreviations should be consistent throughout the context (e.g. GA)
*Please avoid citing or adding links to Wikipedia.
*Please remove the sentence, "as documented in Computational Optimization and Applications."
*More details are expected for Algorithm Discussion section.


== [[Simulated annealing]] ==
== [[Simulated annealing]] ==
*Please provide citations in the application section to support your statements.
*Provide some figures for the numerical study
*Substitute those symbols in a formal way (e.g. T_min should be in a formal way).
*Once the abbr. is defined please use it throughout the context (e.g. SA)
*Once the abbr. is defined please use it throughout the context (e.g. SA)
*There are many extra words throughout the sections, (e.g., “Spaces” in the last sentence of Introduction section, “D.” in section 2.1)
*Avoid using pronouns (e.g., we) in scientific writing.
*Avoid using pronouns (e.g., we) in scientific writing.


== [[Particle swarm optimization]] ==
== [[Particle swarm optimization]] ==
*"The concept was presented at the IEEE conference on neural networks in 1995" Is a citation needed here?
*The caption was missed for the iteration results.
*"Relevance to modern optimization problems makes PSO an interesting research area."
*What does the square symbol mean in the x_best,p symbol. Same issues also are found in the following texts.
*"The convergence of the algorithm can be checked in a few different ways"
*It should be "hyperparameters" instead of "hyper parameters"
*It should be "Python" instead of "python"
*It may not be good to provide code in the Wiki editing page.
*In the equation, please try to use symbols only. One example could be in page 13, you can mention pbo in previous context not in the form of equations. Please check this throughout the context.
*"Depending on how the code is set up, scaling and offset factors may be required."
*Import a figure as function is acceptable now, but should be completed in all equation format when doing on the Wiki page.
*Please revise the reference formate based on our provided examples.
*Figure 1 can be revised by making the first letter of "converged?" capitalized and by centering the text for each box.
*Avoid using pronouns (e.g., we) in scientific writing.


== [[Differential evolution]] ==
== [[Differential evolution]] ==
*Once abbreviations are introduced, please make sure the full term do not appear throughout the context.
*Visualization section is not necessary. Figures should be embedded in the Wiki page.
*Conclusion and References sections should not belong to Application section.
*References are already shown at the bottom of the page. The extra list should be removed.

Latest revision as of 19:26, 17 December 2024

Computational complexity

  • References were not provided to support applications on computer science and quantum computing.

Heuristic algorithms

  • Adding more details to the Application Section is recommended.
  • Please use FigureX as a reference in the text.
  • Avoid using contraction (e.g., there's) in scientific writing.

Local branching

  • The title should be “Problem Solution” instead of ”Problem Resolution“.
  • The added figure is too small for viewing from the main page and also lacks captions and explanations.
  • There are still some formatting issues with the subtitles. For example, some are in bold form while others are not in the content.

Trust-region methods

  • Please label the figures with numbers and direct readers to the figures in text.
  • References were not well formatted (e.g., Yuan, Y. (2015b)).

Quadratic programming

  • An inappropriate nonconvex example was used in the Wiki Page. The problem is an MIQP problem instead of a single QP problem.
  • Some symbols used in the pseudocodes still lack explanation.

Subgradient optimization

  • References were not well formatted.
  • Symbols used in equations lack explanations.
  • The application section was not well drafted and supported by references.

Eight step procedures

  • For the algorithm description, it would be better to have a pseudocode or a flow chart to summarize it.
  • Please use Latex equation editor for equations.
  • Please number and label all figures and tables, use FigureX, TableX as a reference in the text.
  • Please place references after the period at the end of each sentence and avoid after the optimization problems. This goes for all the sections in the wiki.

Nondifferentiable Optimization

  • Most contents are from previous year. The Wiki page should be your original content.
  • It is also recommended to revise the citation format based on our example files.
  • Please add the case of non convex functions.
  • Please add references to support the content in the Introduction section. In-text citations are required.
  • Please use Latex equation editor for typing symbols and equations.
  • The Numerical Example section is incomplete.
  • Application and Conclusion sections are missing.

Evolutionary multimodal optimization

  • Please include more citations in Algorithm Discussion section to support the contents.
  • Please use FigureX as a reference in the text.

Stackelberg leadership model

  • Please use flowchart/pseudocode for representing the steps of algorithm
  • Check the consistency of abbreviations (e.g. what is PAWS?)

Quadratic constrained quadratic programming

  • Form of in-text citation is not proper
  • Abbreviations should be introduced only once throughout all sections (e.g., QCQP, QP, SDP)
  • Avoid using pronouns (e.g., we) in scientific writing.

Derivative free optimization

  • Please try to include a flowchart or pseudocode for illustration of the algorithm.
  • If DFO is defined in the previous sections, please use such abbreviations consistently (same for other abbreviations).

Signomial problems

  • There is a lack of numerical examples for illustrating the global optimization method introduced on the Wiki page.
  • The clarification of the equations used in the Introduction section needs to be improved.

Adadelta

  • There is an extra line of citation links in the References section.

Adafactor

  • The clarity of the alghrithm and numerical example session needs to be improved. It is convenient to list all equations, but not good to present it to others.
  • More citations are needed for supporting your statement.

AdamW

  • For the application section, it would be good to emphasize the advantages of AdamW compared to other approach by citing the quantitative results from previous literature.
  • Avoid using pronouns (e.g., we, let's) in scientific writing.

Adamax

  • The pseudocode was not well defined. More explanations and logical flow are needed.
  • Citations need to be included in the punctuation like period.
  • Since this is a modified version of Adam, a comparison with Adam is needed for the numerical example.
  • A machine learning case is needed since this is an algorithm designed for machine learning models.

FTRL algorithm

  • It is very difficult to clarify different levels of subtitles based on the text.
  • References were not well formatted. For example, "[1]" is added to many references with no meaning.
  • Some symbols used in the equation lack explanations.

LossscaleOptimizer

  • More citations are needed for supporting the statement and applications.

Nadam

  • The result figures of the numerical example have not been placed in the proper place.
  • The numerical example and application parts are still not representative of illustrating NDAM's performance for machine learning models.

Beyesian optimization

  • Citation form (in text) should be double checked.

Genetic algorithm

  • Please provide some citations for supporting your statement (e.g. in Introduction)

Simulated annealing

  • Once the abbr. is defined please use it throughout the context (e.g. SA)
  • Avoid using pronouns (e.g., we) in scientific writing.

Particle swarm optimization

  • The caption was missed for the iteration results.

Differential evolution

  • Once abbreviations are introduced, please make sure the full term do not appear throughout the context.
  • Visualization section is not necessary. Figures should be embedded in the Wiki page.
  • Conclusion and References sections should not belong to Application section.
  • References are already shown at the bottom of the page. The extra list should be removed.
Retrieved from "https://optimization.cbe.cornell.edu/index.php?title=2024_Cornell_Optimization_Open_Textbook_Feedback&oldid=7751"