2021 Cornell Optimization Open Textbook Feedback - Revision history

Youfengqi at 21:52, 21 December 2021

2021-12-21T21:52:33Z

← Older revision		Revision as of 17:52, 21 December 2021
Line 5:		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.
	~~== [[Disjunctive inequalities\|Disjunctive Inequalities]] ==~~
	==[[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.
Line 13:		Line 11:
	# The inline notations (`x1`, `s1`) should also be typed using LaTex.		# The inline notations (`x1`, `s1`) should also be typed using LaTex.

	~~==[[Exponential transformation\|Exponential Transformation]]==~~		==[[Portfolio optimization\|Portfolio Optimization]]==
	== [[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.”
Line 41:		Line 37:
	* A conclusion section		* A conclusion section
	# Consider adding future research directions		# Consider adding future research directions
	~~== [[Geometric programming\|Geometric Programming]] ==~~		==[[Adam]]==

	== [[Adam]] ==

	* Theory, methodology, and/or algorithmic discussions		* Theory, methodology, and/or algorithmic discussions
Line 79:		Line 73:
	# Please format the algorithm in proper algorithmic pseudocode format.		# Please format the algorithm in proper algorithmic pseudocode format.

	~~== [[Momentum]] ==~~		==[[Outer-approximation (OA)\|Outer-approximation]]==
	~~== [[Stochastic dynamic programming\|Stochastic Dynamic programming]] ==~~
	== [[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)
Line 90:		Line 81:
	* At least one numerical example		* At least one numerical example
	# Fix typo “while minimize” to “while minimizing”.		# Fix typo “while minimize” to “while minimizing”.
	~~== [[Frank-Wolfe]] ==~~		==[[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).
	~~== [[Piecewise linear approximation\|Piecewise Linear Approximation]]==~~		==[[Wing shape optimization\|Wing shape Optimization]]==
	~~== [[Mathematical programming with equilibrium constraints\|Mathematical Programming with Equilibrium constraints]] ==~~

	== [[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.
Line 114:		Line 99:
	# Fix typo “optimisation”.		# Fix typo “optimisation”.

	~~== [[AdaGrad\|Adagrad]] ==~~		==[[McCormick envelopes\|McCormick Envelopes]]==
	== [[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]]

Btantisujjatham: /* Bayesian Optimization */

2021-12-20T03:14:49Z

Bayesian Optimization

← Older revision		Revision as of 23:14, 19 December 2021
Line 31:		Line 31:
	== [[Bayesian Optimization]] ==		== [[Bayesian Optimization]] ==
	* Theory, methodology, and/or algorithmic discussions		* Theory, methodology, and/or algorithmic discussions
	~~# 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
	~~# 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.~~
	* 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]] ==

Aw843cornell: /* Wing shape Optimization */

2021-12-19T21:50:03Z

Wing shape Optimization

← Older revision		Revision as of 17:50, 19 December 2021
Line 108:		Line 108:
	* 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 section to discuss and/or illustrate 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.

Aw843cornell: /* Portfolio Optimization */

2021-12-19T21:49:19Z

Portfolio Optimization

← Older revision		Revision as of 17:49, 19 December 2021
Line 20:		Line 20:
	* 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).

Btantisujjatham at 14:39, 19 December 2021

2021-12-19T14:39:38Z

← Older revision		Revision as of 10:39, 19 December 2021
Line 125:		Line 125:

	== [[AdaGrad\|Adagrad]] ==		== [[AdaGrad\|Adagrad]] ==
	* References
	~~# References not properly formatted~~

	== [[McCormick envelopes\|McCormick Envelopes]] ==		== [[McCormick envelopes\|McCormick Envelopes]] ==

Asa273: /* Adagrad */

2021-12-19T14:01:05Z

Adagrad

← Older revision		Revision as of 10:01, 19 December 2021
Line 126:		Line 126:
	== [[AdaGrad\|Adagrad]] ==		== [[AdaGrad\|Adagrad]] ==
	* References		* References
	*# References not properly formatted		# References not properly formatted

	== [[McCormick envelopes\|McCormick Envelopes]] ==		== [[McCormick envelopes\|McCormick Envelopes]] ==

Asa273: /* Outer-approximation */

2021-12-19T14:00:49Z

Outer-approximation

← Older revision		Revision as of 10:00, 19 December 2021
Line 92:		Line 92:

	* 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]] ==

Asa273: /* Interior point method for NLP */

2021-12-19T14:00:38Z

Interior point method for NLP

← Older revision		Revision as of 10:00, 19 December 2021
Line 119:		Line 119:

	* 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]] ==		== [[AdaGrad\|Adagrad]] ==
	* References		* References

Asa273: /* Trust-region methods */

2021-12-19T14:00:26Z

Trust-region methods

← Older revision		Revision as of 10:00, 19 December 2021
Line 81:		Line 81:
	== [[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.
	*# Please format the algorithm in proper algorithmic pseudocode format.		# Please format the algorithm in proper algorithmic pseudocode format.

	== [[Momentum]] ==		== [[Momentum]] ==
	== [[Stochastic dynamic programming\|Stochastic Dynamic programming]] ==		== [[Stochastic dynamic programming\|Stochastic Dynamic programming]] ==

Asa273: /* Stochastic Programming */

2021-12-19T13:59:40Z

Stochastic Programming

← Older revision		Revision as of 09:59, 19 December 2021
Line 11:		Line 11:
	# 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.		# The inline notations (`x1`, `s1`) should also be typed using LaTex.

	* A section to discuss and/or illustrate the applications;
	==[[Exponential transformation\|Exponential Transformation]]==		==[[Exponential transformation\|Exponential Transformation]]==
	== [[Portfolio optimization\|Portfolio Optimization]] ==		== [[Portfolio optimization\|Portfolio Optimization]] ==