AI RESEARCH
Progressively Sampled Equality-Constrained Optimization
arXiv CS.LG
•
ArXi:2510.00417v2 Announce Type: replace-cross An algorithm is proposed, analyzed, and tested for solving continuous nonlinear-equality-constrained optimization problems where the objective and constraint functions are defined by expectations or averages over large, finite numbers of terms. The main idea of the algorithm is to solve a sequence of related problems, each involving finite samples of objective- and constraint-function terms, over which the sample sets grow progressively.