An algorithm based on the interior-point methodology for solving continuous nonlinearly constrained optimization problems is proposed, analyzed, and tested. The distinguishing feature of the algorithm is that it presumes that only noisy values of the objective and constraint functions and their first-order derivatives are available. The algorithm is based on a combination of a previously proposed interior-point algorithm that allows inexact subproblem solutions and recently proposed algorithms for solving bound- and equality-constrained optimization problems with only noisy function and derivative values. It is shown that the new interior-point algorithm drives a stationarity measure below a threshold that depends on bounds on the noise in the function and derivative values. The results of numerical experiments show that the algorithm is effective across a wide range of problems.
An interior-point algorithm for continuous nonlinearly constrained optimization with noisy function and derivative evaluations. // Applied Nanoscience. – 2026. – DOI: 10.1007/s10107-026-02433-2. – URL: https://link.springer.com/article/10.1007/s10107-026-02433-2
(2026). An interior-point algorithm for continuous nonlinearly constrained optimization with noisy function and derivative evaluations. Applied Nanoscience. https://doi.org/10.1007/s10107-026-02433-2
“An interior-point algorithm for continuous nonlinearly constrained optimization with noisy function and derivative evaluations.” Applied Nanoscience, 2026. doi:10.1007/s10107-026-02433-2.
@article{article34409,
title = {An interior-point algorithm for continuous nonlinearly constrained optimization with noisy function and derivative evaluations},
journal = {Applied Nanoscience},
year = {2026},
doi = {10.1007/s10107-026-02433-2},
url = {https://link.springer.com/article/10.1007/s10107-026-02433-2}
}
Introduced by Beck and Teboulle in [1], FISTA (Fast Iterative Shrinkage-Thresholding Algorithm) is a first-order method widely used in convex optimization. Adapted from Nesterov’s accelerated gradient method for convex functions [2],...
The progressive decoupling algorithm solves problems of optimization by iteratively suppressing complications coming from linear linkage relations. Here its formulation is significantly extended and a sharper theory of convergence is...
This paper introduces a class of two-stage stochastic minimax problems where the first-stage objective function is nonconvex-concave while the second-stage objective function is strongly convex-concave. We establish properties of the...
Inspired by Von Neumann’s foundational work on expected utility, this paper extends the data-driven expected utility maximization framework under constant absolute risk aversion (CARA) preferences by incorporating nonlinear payoff...
This paper develops a unified lattice-theoretic framework for envelope constructions of sets and extended real-valued functions. Given a subset $$\mathcal {F}$$ of a complete lattice $${\mathcal {E}}$$, we associate with $$\mathcal...