Sufficient conditions for global optimality of semidefinite optimization

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this article, by using the Lagrangian function, we investigate the sufficient global optimality conditions for a class of semi-definite optimization problems, where the objective function are general nonlinear, the variables are mixed integers subject to linear matrix inequalities (LMIs) constraints as well as bounded constraints. In addition, the sufficient global optimality conditions for general nonlinear programming problems are derived, where the variables satisfy LMIs constraints and box constraints or bivalent constraints. Furthermore, we give the sufficient global optimality conditions for standard semi-definite programming problem, where the objective function is linear, the variables satisfy linear inequalities constraints and box constraints. © 2012 Quan et al.

Cite

CITATION STYLE

APA

Quan, J., Wu, Z., Li, G., & Wu, O. (2012). Sufficient conditions for global optimality of semidefinite optimization. Journal of Inequalities and Applications, 2012. https://doi.org/10.1186/1029-242X-2012-108

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free