2024 Cornell Optimization Open Textbook Feedback

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

Computational complexity

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

Sequential quadratic programming

Subgradient optimization

Dynamic optimization

Nondifferentiable Optimization

Evolutionary multimodal optimization

Stackelberg leadership model

Quadratic constrained quadratic programming

Derivative free optimization

Signomial problems

Adadelta

Adafactor

AdamW

Adamax

FTRL algorithm

Lion algorithm

LossscaleOptimizer

Nadam

Beyesian optimization

Genetic algorithm

Simulated annealing

Particle swarm optimization

Differential evolution