A Retrospective-Approximation Interior-Point Method
Abstract
An algorithm is proposed, analyzed, and tested for solving nonlinearly constrained continuous optimization problem instances wherein the objective function is defined by an expectation over a random variable argument and the constraints include inequalities (and perhaps equalities) involving functions that may be nonconvex. The algorithm combines a retrospective-approximation strategy for handling the objective and an interior-point approach for handling the constraints. In each iteration of an outer loop, the objective is approximated by an empirical average over a set of realizations of the random variable argument and the resulting sampled problem is solved with an interior-point method that allows inexact search-direction computations for computational flexibility. Termination conditions for the interior-point method are tailored for those needed for convergence guarantees by the outer loop. Over the outer loop, the sample set is updated adaptively in such a manner that convergence guarantees for solving the original optimization problem can be assured. The results of numerical experiments are presented, which show that the proposed algorithm can outperform competing methods that have comparable theoretical guarantees.
Related
- A Practical Combinatorial Interior Point Method for Minimum-Cost Flow
- Learned Preconditioning for a Primal-Dual Interior-Point Method
- Heat equation with singular drift which has bounded solution discontinuous at an interior point
- Polytopic symmetric interior-penalty approximation of elliptic SPDEs driven by spatial white noise
- Clarabel: An interior-point solver for conic programs with quadratic objectives
BibTeX
@misc{curtis2026retrospectiveapproximation,
title = {{A Retrospective-Approximation Interior-Point Method}},
author = {Frank E. Curtis and Zahra Khatti and Daniel P. Robinson},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.38857},
eprint = {2610.38857},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.38857},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - A Retrospective-Approximation Interior-Point Method
AU - Frank E. Curtis
AU - Zahra Khatti
AU - Daniel P. Robinson
PY - 2026
DA - 2026/10/28
PB - arXiv
DO - 10.48550/arxiv.2610.38857
UR - https://arxiv.org/abs/2610.38857
AB - An algorithm is proposed, analyzed, and tested for solving nonlinearly constrained continuous optimization problem instances wherein the objective function is defined by an expectation over a random variable argument and the constraints include inequalities (and perhaps equalities) involving functions that may be nonconvex. The algorithm combines a retrospective-approximation strategy for handling the objective and an interior-point approach for handling the constraints. In each iteration of an outer loop, the objective is approximated by an empirical average over a set of realizations of the random variable argument and the resulting sampled problem is solved with an interior-point method that allows inexact search-direction computations for computational flexibility. Termination conditions for the interior-point method are tailored for those needed for convergence guarantees by the outer loop. Over the outer loop, the sample set is updated adaptively in such a manner that convergence guarantees for solving the original optimization problem can be assured. The results of numerical experiments are presented, which show that the proposed algorithm can outperform competing methods that have comparable theoretical guarantees.
ER -