A Feasible Direction Method with Active-Set Identification for Derivative-Free Optimization
Abstract
We propose a model-based trust region method for derivative-free optimization with simulation-based inequality constraints. We are motivated by settings of simulation optimization in which both function evaluations at infeasible points may be unreliable and constraint evaluations are expensive. Our method maintains feasible incumbents and computes steps from a subproblem suitable for a feasible-direction method in order to encourage generation of feasible trial points. To reduce the computational cost of modeling the constraints, we describe an active-set estimation scheme that permits modeling with only a subset of constraints in each subproblem, as opposed to maintaining models of all constraints. We show that every limit point of the incumbents generated by our method is a Fritz-John point, and is additionally a KKT point under the Mangasarian-Fromovitz constraint qualification. Under standard nondegeneracy conditions, the active-set estimate identifies, within finite time, all constraints active at the limit point of the incumbents. Experiments on CUTEst problems show that our method generates feasible trial points more often than a comparable SQP-based approach and is competitive with an appropriate comparator in budgeted settings.
Related
- A Feasible-Direction-Type Method for Nonconvex Optimization with Infeasible Starts
- TOBYQA: A Time-Augmented Model-Based Method for Derivative-Free Optimization under Noise and Temporal Drift
- Derivative Gaussian Processes on a Two-Direction Budget
- Anytime-Feasible Gradient Descent for Constrained Optimization Under Gradient Uncertainty
- Convex Optimization with Nested Evolving Feasible Sets (CONES) under Time-Varying Loss Functions
BibTeX
@misc{larson2026feasible,
title = {{A Feasible Direction Method with Active-Set Identification for Derivative-Free Optimization}},
author = {Jeffrey Larson and Matt Menickelly and Lara Zebiane},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.17101},
eprint = {2610.17101},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.17101},
}
RIS
TY - UNPB
TI - A Feasible Direction Method with Active-Set Identification for Derivative-Free Optimization
AU - Jeffrey Larson
AU - Matt Menickelly
AU - Lara Zebiane
PY - 2026
DA - 2026/10/28
PB - arXiv
DO - 10.48550/arxiv.2610.17101
UR - https://arxiv.org/abs/2610.17101
AB - We propose a model-based trust region method for derivative-free optimization with simulation-based inequality constraints. We are motivated by settings of simulation optimization in which both function evaluations at infeasible points may be unreliable and constraint evaluations are expensive. Our method maintains feasible incumbents and computes steps from a subproblem suitable for a feasible-direction method in order to encourage generation of feasible trial points. To reduce the computational cost of modeling the constraints, we describe an active-set estimation scheme that permits modeling with only a subset of constraints in each subproblem, as opposed to maintaining models of all constraints. We show that every limit point of the incumbents generated by our method is a Fritz-John point, and is additionally a KKT point under the Mangasarian-Fromovitz constraint qualification. Under standard nondegeneracy conditions, the active-set estimate identifies, within finite time, all constraints active at the limit point of the incumbents. Experiments on CUTEst problems show that our method generates feasible trial points more often than a comparable SQP-based approach and is competitive with an appropriate comparator in budgeted settings.
ER -