Consider a minimization problem of a convex quadratic function of several variables over a set of inequality constraints of the same type of function. The duel program is a maximization problem with a concave objective function and a set of constrains that are essentially linear. However, the objective function is not differentiable over the constraint region.In this paper, we study a general theory of dual perturbations and derive a fundamental relationship between a perturbed dual program and the original problem. Based on this relationship, we establish a perturbation theory to display that a well-controlled perturbation on the dual program can overcome the nondifferentiability issue and generate an ε-optimal dual solution for an arbitrarily small number ε. A simple linear program is then constructed to make an easy conversion from the dual solution to a corresponding ε-optimal primal solution. Moreover, a numerical example is included to illustrate the potential of this controlled perturbation scheme.
[1]
J. G. Ecker,et al.
A Dual Method for Quadratic Programs with Quadratic Constraints
,
1975
.
[2]
E. Phan-huy-Hao,et al.
Quadratically constrained quadratic programming: Some applications and a method for solution
,
1982,
Z. Oper. Research.
[3]
J. Ecker,et al.
Geometric programming: Duality in quadratic programming and lp-approximation III (degenerate programs)
,
1970
.
[4]
Joseph G. Ecker,et al.
Geometric Programming: Duality in Quadratic Programming and $l_p $-Approximation II (Canonical Programs)
,
1969
.
[5]
J. Ecker,et al.
A Reduced Gradient-method for Quadratic Programs With Quadratic Constraints and Lp-constrained Lp-approximation Problems
,
1982
.