ISSN 1997-7670 (Print)
ISSN 2541-8785 (Online)

List of issues > Series «Mathematics». 2016. Vol. 18

A Method for Semidefinite Quasiconvex Maximization Problem

R. Enkhbat, M. Bellalij, K. Jbilou, T. Bayartugs

We introduce so-called semidefinite quasiconvex maximization problem. We derive new global optimality conditions by generalizing [9]. Using these conditions, we construct an algorithm which generates a sequence of local maximizers that converges to a global solution. Also, new applications of semidefinite quasiconvex maximization are given. Subproblems of the proposed algorithm are semidefinite linear programming.

Semidefinite linear programming, global optimality conditions, semidefinite quasiconvex maximization, algorithm, approximation set


90C26, 93C05


1. Arslan G., Demirkol M.F. and Song Y., Equilibrium efficiency improvementin MIMO interference systems: a desentralized stream control apprioch. IEEETransaction on Wireless Communications, Vol. 6, Issue 8, August, 2007, pp.2984-2993.

2. Bouhamidi A., Enkhbat R., Jbilou K. Semidefinite Concave Programming.Journal of Mongolian Mathematical Society, 2012, vol. 16, pp. 37-46.

3. Balakrishnan A.V. Introduction to Optimization Theory in a Hilbert Space.Springer-Verlag, 1970.

4. Enkhbat R. Quasiconvex Programming and its Applications. Lambert Publisher,Germany, 2009.

5. Enkhbat R., Bayartugs T., Quasiconvex Semidefinite Minimization Problem.Journal of Optimization: Hindawi Publishing Corporation, 2013, vol. 201, articleID 346131, 6 p.

6. Enkhbat R., Bayartugs T. Semidefinite Quasiconcave programming. InternationalJournal of Pure and Applied Mathematics, 2013, vol. 87, no 4, pp. 547-557.

7. Pardalos P.M., Wolkowicz H. (eds.) Topics in Semidefinite and Interior PointMethods. Fields Institute Communications 18, AMS, Providence, Rhode Island,1998.

8. Rockafellar R.T. Convex Analysis. Princeton University Press, 1970.

9. Strekalovsky A.S. Global Optimality Conditions for Nonconvex Optimization.Journal of Global Optimization, 1998, vol. 12, pp. 415-434

10. Strekalovsky A.S., Enkhbat R. Global Maximum of Convex Functions on anArbitrary Set. Dep. in VINITI, Irkutsk, 1063, pp.1-27, 1990.

11. Jerome Malick, Janez Povh, Franz Rendl, Angelika Wiegele. Regularizationmethods for semidefinite programming. September 1, 2008.

12. Sigen. Ye, Rick S., Blum. Optimized signaling for MIMO interference systems withfeedback. IEEE Transactions on Signal Processing 51(11), 2003, pp. 2839-2848.

13. Vandenberghe L., Boyd S. Semidefinite programming. SIAM Rev., 1996, vol. 38,pp. 49-95.

14. Zhang Y. On extending some primal-dual interior point algorithms fromlinearprogramming to semidefinite programming. SIAM Journal on Optimization, 1998,vol. 8, no 2, pp. 365-386.

15. Zhang L., Zhang Y., Liang Y.C., Xin Y. and Poor H.V. On the GaussianMIMO BC-MAC duality with multiple transmit covarianca constraints. IEEETransactions on Information Theory, 2012, vol. 58, no 4, april.

16. Tzu-Chen Liang, Ta-Chung Wang, and Yinyu Ye. A Gradient Search Method toRound the Semidefinite Programming Relaxation Solution for Ad Hoc WirelessSensor Network Localization. TECHNICAL REPORT SOL 2004-2. December,2004.

17. Wolkowicz H., Saigal R. and Vandenberghe L. Handbook of Semidefinite Programming.Kluwer, 2000.

18. Jansen K., Rolim J., Sudan M. Linear Semidefinite Programming and RandomizationMethods for Combinatorial Optimization Problems. Dagstuhl Seminar no00041, Report no 263, 2012.

Full text (english)