Some properties of boundedly perturbed strictly convex quadratic functions
From MaRDI portal
Publication:3225067
DOI10.1080/02331931003746114zbMath1261.90034MaRDI QIDQ3225067
Publication date: 15 March 2012
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331931003746114
stability; generalized convexity; global minimizer; Kuhn-Tucker theorem; bounded perturbation; subdifferentiability
49K40: Sensitivity, stability, well-posedness
90C26: Nonconvex programming, global optimization
90C20: Quadratic programming
90C46: Optimality conditions and duality in mathematical programming
90C31: Sensitivity, stability, parametric optimization
47H14: Perturbations of nonlinear operators
Related Items
Maximizing strictly convex quadratic functions with bounded perturbations, Necessary and sufficient conditions of optimality for second order discrete and differential inequalities
Cites Work
- Unnamed Item
- Continuity of the solution map in quadratic programs under linear perturbations
- Lipschitz behavior of convex semi-infinite optimization problems: a variational approach
- Duality theorems for perturbed convex optimization
- Some applications of mathematical programming techniques in optimal power dispatch
- Lower semicontinuity of the minimum in parametric convex programs
- Strictly and roughly convexlike functions
- Scheduling of power generation via large-scale nonlinear optimization
- \(\gamma\)-subdifferential and \(\gamma\)-convexity of functions on a normed space
- \(\gamma\)-subdifferential and \(\gamma\)-convexity of functions on the real line
- On the optimal value function of a linearly perturbed quadratic program
- Stability of the solution of definite quadratic programs
- Perturbed convex programming in reflexive Banach spaces
- Outer Γ-Convexity in Vector Spaces
- Estimates for Kuhn-Tucker points of perturbed convex programs
- Characterizing an optimal input in perturbed convex programming
- Symmetricallyγ-Convex Functions
- Support set expansion sensitivity analysis in convex quadratic optimization
