2024 Cornell Optimization Open Textbook Feedback

From Cornell University Computational Optimization Open Textbook - Optimization Wiki
Revision as of 14:11, 13 December 2024 by SYSEN5800TAs (talk | contribs)
Jump to navigation Jump to search

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.
  • 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.

Heuristic algorithms

Local branching

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 try to update equations on page 5.
  • 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 problems typically are formatted as minimization problems, and the general mathematical formulation is "
  • "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."
  • "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

Dynamic optimization

Nondifferentiable Optimization

Evolutionary multimodal optimization

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
  • 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

  • Please double-check that all cited Figures are clearly attached with citations.
  • 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)
  • 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

  • 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.
  • 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

Adadelta

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.
  • Please revise your reference format.
  • 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

  • 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.
  • 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.
  • The code snippet in the Application section can be removed.

Adamax

FTRL algorithm

Lion algorithm

LossscaleOptimizer

  • Provide more citations to support your statements in the Application section?
  • 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

Beyesian optimization

  • Only suggestion is that providing code may not be appropriate in the Wiki page (all on your decision).
  • 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

  • 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)
  • 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

  • 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)
  • 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.

Particle swarm optimization

Differential evolution