Quantitative Sensitivity Bounds for Nonlinear Programming and Time-Varying Optimization

DOI10.1109/TAC.2021.3093857MaRDI QIDQ5092186zbMATH OpenFDO

Authors Irina Subotić, Adrian Hauswirth, Florian Dörfler

Publication date 28 July 2022

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2006.10693

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Cited in

(5)

• scientific article; zbMATH DE number 1688572 (Why is no real title available?)
• Quantitative Sensitivity Bounds for Nonlinear Programming and Time-varying Optimization
• Achieving violation-free distributed optimization under coupling constraints
• On decentralized computation of the leader's strategy in bi-level games
• Post-optimality sensitivity analysis in abstract spaces with applications to continuous-time programming problems

This page was built for publication: Quantitative Sensitivity Bounds for Nonlinear Programming and Time-Varying Optimization

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