On Sensitivity Analysis of Nonlinear Programs in Banach Spaces: The Approach via Composite Unconstrained Optimization
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This article studies local sensitivity analysis of nonlinear programming problems in Banach spaces with arbitrary sets of solutions and no a priori regularity properties by developing a corresponding theory for unconstrained optimization and applying this theory to general nonlinear programs by way of certain reduction principles.
Abstract
This article studies local sensitivity analysis of nonlinear programming problems in Banach spaces with arbitrary sets of solutions and no a priori regularity properties. This is done by first developing a corresponding theory for unconstrained optimization involving simple composite functions and then applying this theory to general nonlinear programs by way of certain reduction principles.
