On Sensitivity Analysis of Nonlinear Programs in Banach Spaces: The Approach via Composite Unconstrained Optimization

DOI10.1137/0804001zbMath0820.90105OpenAlexW2027741643MaRDI QIDQ4294742

Alexander D. Ioffe

Publication date: 18 May 1994

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0804001

zbMATH Keywords

sensitivity analysisunconstrained nonsmooth optimizationreduction to unconstrained minimizationnonlinear programming problems in Banach spaces

Mathematics Subject Classification ID

Sensitivity, stability, well-posedness (49K40) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48)

Related Items (8)

Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions ⋮ A stabilized filter SQP algorithm for nonlinear programming ⋮ On Hölder calmness of minimizing sets ⋮ Convergence analysis of a regularized interior point algorithm for the barrier problems with singular solutions ⋮ The cluster problem in constrained global optimization ⋮ On global quadratic growth condition for min-max optimization problems with quadratic functions ⋮ Optimality conditions in smooth nonlinear programming ⋮ Optimality Conditions in Semidefinite Programming

This page was built for publication: On Sensitivity Analysis of Nonlinear Programs in Banach Spaces: The Approach via Composite Unconstrained Optimization