Fixed and Variable Constraints in Sensitivity Analysis

DOI10.1137/0318021MaRDI QIDQ3873943zbMATH OpenOpenAlexFDO

Authors Jonathan E. Spingarn

Publication date 1980

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

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

zbMATH Keywords

cyrtohedrafixed and variable constraintsfixed constraind setsLagrange multipliersparametrized families of nonlinear programming problemssensitivity analysis

Mathematics Subject Classification ID

Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)

Cited in

(6)

• Sensitivity and stability analysis for nonlinear programming
• Convergence of asymptotic directions
• Applications of the method of partial inverses to convex programming: Decomposition
• Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs
• On optimality conditions for structured families of nonlinear programming problems
• Versions of the Sard theorem for essentially smooth Lipschitz maps and applications in optimization and nonsmooth equations

This page was built for publication: Fixed and Variable Constraints in Sensitivity Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3873943)