Stable sequential Kuhn-Tucker theorem in iterative form or a regularized Uzawa algorithm in a regular nonlinear programming problem
DOI10.1134/S0965542515060111zbMath1327.90327OpenAlexW916687805MaRDI QIDQ498579
Publication date: 29 September 2015
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542515060111
stabilityregularizationperturbation methoddualitynonlinear programmingsequential optimizationminimizing sequenceLagrange principle Kuhn-Tucker Theorem in nondifferential formparametric problemPontyagin's maximum principle
Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Programming in abstract spaces (90C48)
Related Items (2)
Cites Work
- Suboptimal control of distributed-parameter systems: Minimizing sequences and the value function
- Multiplier and gradient methods
- Regularized parametric Kuhn-Tucker theorem in a Hilbert space
- Stable sequential convex programming in a Hilbert space and its application for solving unstable problems
- Proximal Analysis and Boundaries of Closed Sets in Banach Space, Part I: Theory
- Optimization and nonsmooth analysis
- Duality-based regularization in a linear convex mathematical programming problem
- Sequential stable Kuhn-Tucker theorem in nonlinear programming
- Regularized dual method for nonlinear mathematical programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Stable sequential Kuhn-Tucker theorem in iterative form or a regularized Uzawa algorithm in a regular nonlinear programming problem