Maximizing strictly convex quadratic functions with bounded perturbations

DOI10.1007/S10957-010-9772-4zbMath1221.90075OpenAlexW2086509975WikidataQ57659444 ScholiaQ57659444MaRDI QIDQ639197

Vo Minh Pho, Hoang Xuan Phu, Phan Thanh An

Publication date: 18 September 2011

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-010-9772-4

zbMATH Keywords

stabilitygeneralized convexityquadratic functionconvex maximizationbounded perturbation

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31)

Cites Work

• Unnamed Item
• Unnamed Item
• Global infimum of strictly convex quadratic functions with bounded perturbations
• Continuity of the solution map in quadratic programs under linear perturbations
• Lipschitz behavior of convex semi-infinite optimization problems: a variational approach
• A vertex ranking algorithm for the fixed-charge transportation problem
• Duality theorems for perturbed convex optimization
• Some applications of mathematical programming techniques in optimal power dispatch
• Characterization of perturbed mathematical programs and interval analysis
• Lower semicontinuity of the minimum in parametric convex programs
• Outer \(\gamma\)-convexity in normed linear spaces
• Upper Lipschitz behavior of solutions to perturbed \(C^{1,1}\) programs
• Scheduling of power generation via large-scale nonlinear optimization
• \(\gamma\)-subdifferential and \(\gamma\)-convexity of functions on a normed space
• Inner \(\gamma\)-convex functions in normed linear spaces
• Outer \(\gamma\)-convexity and inner \(\gamma\)-convexity of disturbed functions
• Supremizers of inner \(\gamma\)-convex functions
• On the optimal value function of a linearly perturbed quadratic program
• Stable generalization of convex functions
• Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
• Minimizing Convex Functions with Bounded Perturbations
• Stability of the solution of definite quadratic programs
• Some properties of boundedly perturbed strictly convex quadratic functions
• Perturbed convex programming in reflexive Banach spaces
• Outer Γ-Convexity in Vector Spaces
• Global minimization of large-scale constrained concave quadratic problems by separable programming
• Estimates for Kuhn-Tucker points of perturbed convex programs
• Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron
• On the lower semicontinuity of optimal sets in convex parametric optimization
• Representation of Bounded Convex Sets By Rational Convex Hull Of Its Gamma-Extreme Points
• Characterizing an optimal input in perturbed convex programming
• Stability Of Generalized Convex Functions With Respect To Linear Disturbances^*
• Some properties of solution sets to nonconvex quadratic programming problems
• Support set expansion sensitivity analysis in convex quadratic optimization
• Solving the Fixed Charge Problem by Ranking the Extreme Points
• On the stability of solutions to quadratic programming problems

This page was built for publication: Maximizing strictly convex quadratic functions with bounded perturbations