Search results
Jump to navigation
Jump to search
- {{Short description|Ratio in Mathematical Optimization}} ...ence|doi=10.1137/1.9781611973075.88 |chapter=Correlation Robust Stochastic Optimization |title=Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discret ...3 KB (516 words) - 13:54, 5 July 2022
- ...at.uc.pt/~lnv/idfo/|accessdate=2014-01-18 |series= MPS-SIAM Book Series on Optimization| publisher=SIAM|location=Philadelphia}}</ref> ...mple the gradient gives the direction of steepest ascent. Derivative-based optimization is efficient at finding local optima for continuous-domain smooth single-mo ...5 KB (625 words) - 07:10, 20 April 2024
- ...ster]],<ref>{{Cite journal | doi = 10.1214/aoms/1177728976| title = On the Stochastic Matrices Associated with Certain Queuing Processes| journal = [[The Annals ...ete-time Markov chain on a countable state space <math>S</math> having a [[Stochastic matrix|transition probability matrix]] <math>P</math> with elements <math>p ...2 KB (310 words) - 11:05, 8 February 2025
- '''Chance-constrained portfolio selection''' is an approach to [[portfolio optimization|portfolio selection]] under [[loss aversion]]. ...ilistic constrained optimization problems," Numerical Algebra, Control and Optimization, 2, No. 4, 767-778. [https://www.aimsciences.org/article/doi/10.3934/naco.2 ...5 KB (686 words) - 09:37, 15 August 2024
- {{Short description|Optimization algorithm}} ...y suited to large-scale population models, adaptive modeling, simulation [[optimization]], and [[atmospheric model]]ing. Many examples are presented at the SPSA we ...9 KB (1,376 words) - 14:56, 4 October 2024
- ...ent''' is an [[Iterative algorithm|iterative]] [[Mathematical optimization|optimization]] [[algorithm]] for finding a [[local minimum]] of a [[differentiable funct ...di Nemirovsky and David Yudin. Problem Complexity and Method Efficiency in Optimization. John Wiley & Sons, 1983</ref> ...4 KB (582 words) - 15:48, 3 September 2024
- ...ic analysis by identifying variables which contribute most to a predefined optimization goal. This includes also the evaluation of robustness, i.e. the sensitivity ...ns, variance based sensitivity analysis quantifies the contribution of the optimization variables for a possible improvement of the model responses. In contrast to ...8 KB (1,064 words) - 22:33, 19 June 2024
- '''Chance Constrained Programming (CCP)''' is a [[mathematical optimization]] approach used to handle problems under uncertainty. It was first introduc ...the use of [[probability]] and confidence levels to handle uncertainty in optimization problems. It distinguishes between single and joint chance constraints: ...6 KB (746 words) - 07:24, 15 December 2024
- {{Short description|Optimization and sampling technique}} [[File:Non-Convex Objective Function.gif|thumb|SGLD can be applied to the optimization of non-convex objective functions, shown here to be a sum of Gaussians.]] ...9 KB (1,326 words) - 16:18, 4 October 2024
- {{short description|Tuning parameter (hyperparameter) in optimization}} ...ed to as '''gain'''.<ref>{{cite journal |first=Bernard |last=Delyon |title=Stochastic Approximation with Decreasing Gain: Convergence and Asymptotic Theory |jour ...9 KB (1,303 words) - 11:15, 30 April 2024
- ...ult and expensive to evaluate. Usually, the underlying simulation model is stochastic, so that the objective function must be estimated using statistical estimat ...Energy'' 113 (2014): 1043–1058.</ref> or 'simulation-based multi-objective optimization' used when more than one objective is involved. ...13 KB (1,802 words) - 19:05, 19 June 2024
- ...ees on the number of required iterations, for several important classes of optimization problems. ...lon>0</math>). This is known as the ''oracle complexity'' of this class of optimization problems: Namely, the number of iterations such that on one hand, there is ...9 KB (1,332 words) - 22:28, 4 February 2025
- {{Short description|Family of optimization algorithms}} ...methods that treat the objective as an infinite sum, as in the classical [[Stochastic approximation]] setting. ...12 KB (1,754 words) - 19:27, 1 October 2024
- ...er uncertainty, and on the other hand, [[Modern portfolio theory|portfolio optimization]] involving multiple investment choices having rate-of-return uncertainty.< ==Dynamic policy optimization== ...7 KB (1,061 words) - 13:13, 7 February 2025
- .../ref> This result was developed within a research project about [[Bayesian optimization]] algorithms. ...tricted, depending on the characteristics of the problem, a specific local optimization method can be used. ...14 KB (2,483 words) - 23:33, 6 April 2023
- ...nd bPOE for common probability distributions with application to portfolio optimization and density estimation |journal=Annals of Operations Research |volume=299 | [[Category:Stochastic processes]] ...4 KB (581 words) - 13:53, 28 March 2024
- ...he Stochastic Rotation Problem: A Generalization of Faustmann's Formula to Stochastic Forest Growth |journal=Journal of Economic Dynamics and Control |volume=22 [[Category:Mathematical optimization]] ...3 KB (397 words) - 04:47, 15 January 2024
- ...or obtaining solutions to [[robust optimization]] and [[chance-constrained optimization]] problems based on a sample of the [[constraint (mathematics)|constraint]] ...ry justifies the use of [[randomization]] in robust and chance-constrained optimization. ...10 KB (1,349 words) - 20:17, 23 November 2023
- ...<ref name="Wirch">{{cite web|title=Distortion Risk Measures: Coherence and Stochastic Dominance|author=Julia L. Wirch|author2=Mary R. Hardy|url=http://pascal.ise # ''Monotone'' with respect to first order [[stochastic dominance]]. ...4 KB (668 words) - 17:53, 26 January 2023
- .../><ref>{{cite arXiv |last1=Ross |first1=I. M. |title=Unscented Trajectory Optimization |date=2024-05-04 |eprint=2405.02753 |last2=Proulx |first2=R. J. |last3=Karp ...ochastic Differential Dynamic Programming for Robust Low-Thrust Trajectory Optimization Problems |conference=2018 AIAA Guidance, Navigation, and Control Conference ...7 KB (956 words) - 23:52, 27 September 2024