Using Conical Regularization in Calculating Lagrangian Estimates in Quadratic Optimization Problems
- 18 Downloads
For nonconvex quadratic optimization problems, the authors consider calculation of global extreme value estimates on the basis of Lagrangian relaxation of the original problems. On the boundary of the feasible region of the estimate problem, functions of the problem are discontinuous, ill-conditioned, which imposes certain requirements on the computational algorithms. The paper presents a new approach taking into account these features, based on the use of conical regularizations of convex optimization problems. It makes it possible to construct an equivalent unconditional optimization problem whose objective function is defined on the entire space of problem variables and satisfies the Lipschitz condition.
Keywordsquadratic optimization problem Lagrangian relaxation condition of nonnegative definiteness of matrix conical regularization
Unable to display preview. Download preview PDF.
- 1.C. Lemarechal, “Lagrangian relaxation,” in: Computational Combinatorial Optimization, 112–156 (2001).Google Scholar
- 2.N. Z. Shor and S. I. Stetsenko, Quadratic Extremum Problems and Nondifferentiable Optimization [in Russian], Naukova Dumka, Kyiv (1989).Google Scholar
- 3.S. Boyd and L. Vandenberghe, “Semidefinite programming relaxations of non-convex problems in control and combinatorial optimization,” in: Communications, Computation, Control, and Signal Processing, Springer, New York (1997), pp. 279–287.Google Scholar
- 7.Yu. P. Laptin, “Conical regularization in quadratic optimization problems,” Komp. Matematika, No. 2, 129–141 (2016).Google Scholar
- 8.B. T. Polyak and P. S. Shcherbakov, “Randomized method to solve semi-definite programming problems,” Stokhastich. Optimiz. v Informatike, Vol. 2, No. 1, 38– 70 (2006).Google Scholar
- 18.V. I. Zorkal’tsev and S. M. Perzhabinsky, “Interior point algorithms in linear and nonlinear programming,” Omskii Nauchnyi Vestnik, Vol. 1, No. 117, 25–28 (2013).Google Scholar
- 24.G. Pataki, “Cone-LP’s and semidefinite programs: Geometry and simplex-type method,” Proc. Conf. on Integer Programming and Combinatorial Optimization (IPCO-5), Vancouver (1996), pp. 1–13.Google Scholar
- 25.V. G. Zhadan, “One variant of feasible affine scaling method for semi-definite programming,” in: Trans. Inst. Math. and Mech. UrO RAN, Vol. 20, No. 2, 145–160 (2014).Google Scholar
- 26.V. G. Zhadan, “One variant of simplex-method for linear semi-definite programming problem,” in: Trans. Inst. Math. and Mech. UrO RAN, Vol. 21, No. 3, 117–127 (2015).Google Scholar
- 29.R. Bellman, Introduction to Matrix Analysis, McGraw-Hill Interamericana (1960).Google Scholar