An interior-point algorithm for continuous nonlinearly constrained optimization with noisy function and derivative evaluations

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.

Authors

Institutions

Publication Details

Journal
Mathematical Programming
Published
2026-11-18
DOI
https://doi.org/10.1007/s10107-026-02433-2
Citations
9
Primary Topic
Advanced Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
2.70

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

An interior-point algorithm for continuous nonlinearly constrained optimization with noisy function and derivative evaluations

Frank E. Curtis, Andreas Wäechter, Shima Dezfulian
9 citations
Mathematical Programming
Advanced Optimization Algorithms Research
2.70
article

An interior-point algorithm for continuous nonlinearly constrained optimization with noisy function and derivative evaluations

Frank E. Curtis, Andreas Wäechter, Shima Dezfulian
article en
9 citations

Abstract

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.

Mathematical Programming
Northwestern University (US), Lehigh University (US)
National Science Foundation, Office of Naval Research
Openalex Percentile: Top 14%
Advanced Optimization Algorithms Research
2.70
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon