Lipschitz properties of solutions in mathematical programming
From MaRDI portal
Publication:1078086
DOI10.1007/BF00938947zbMath0595.90081MaRDI QIDQ1078086
Publication date: 1987
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Numerical methods based on nonlinear programming (49M37)
Related Items
Sensitivity and stability analysis for nonlinear programming, On the stability of solutions in honlinear programming, Fair allocations in large economies, Stability results for stochastic programming problems, An implicit-function theorem for \(C^{0,1}\)-equations and parametric \(C^{1,1}\)-optimization, A dimension-reduced method of sensitivity analysis for stochastic user equilibrium assignment model, On the lower semicontinuity of optimal solution sets, A proof of the necessity of linear independence condition and strong second-order sufficient optimality condition for Lipschitzian stability in nonlinear programming, Metric regularity, openness and Lipschitzian behavior of multifunctions, Convergence properties of an algorithm for solving non-differentiable optimal control problems, Existence, uniqueness and determinacy of Arrow-Debreu equilibria in finance models, Necessary optimality conditions for Stackelberg problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the inverse function theorem
- Lipschitz Behavior of Solutions to Convex Minimization Problems
- Lipschitzian Solutions of Perturbed Nonlinear Programming Problems
- Strongly Regular Generalized Equations
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Generalized Gradients and Applications
- Sensitivity analysis for nonlinear programming using penalty methods
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Convex Analysis
