2 papers
math.OC2026
Stochastic convergence of a class of greedy-type algorithms for Configuration Optimization Problems
Evie Nielen, Oliver Tse
Greedy Sampling Methods (GSMs) are widely used to construct approximate solutions of Configuration Optimization Problems (COPs), where a loss functional is minimized over finite co…
math.NA2024
Polytope Division Method: A Scalable Sampling Method for Problems with High-dimensional Parameters
Evie Nielen, Oliver Tse, Karen Veroy
Configuration Optimization Problems (COPs), which involve minimizing a loss function over a set of discrete points , are common in areas like Model Order R…