## logdet maximization under logdet inequalitie constraint

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

Consider the following convex problem $\max_{\mathbf{A}} \log |\mathbf{I} + \mathbf{CA} |$ subject to $\log |\mathbf{I} + \mathbf{FA} | \leq \xi$ where $\mathbf{A}$ is a semidefinite positive matrix and $\mathbf{I}$ is the identity matrix.

Does exist any closed form solution to $\mathbf{A}$? If not, does exist efficient algorithms to solve this problem?

Thanks in advance,

Mikitov

-

1
I am curious as to whether the problem is really convex. The determinant is log-concave for positive definite arguments, and maximization of a concave function is equivalent to the minimization of a convex function -- so that's ok; however, your constraint is concave. Can you tell us anything about $\mathbf{C}$ and $\mathbf{F}$? – Gilead Dec 25 2010 at 19:19
I'm sorry, I meant your constraint may be concave, not is concave. – Gilead Dec 25 2010 at 19:34
Also, I think it is possible that the problem will not have a simple closed-form solution. If you consider the KKT system for this problem, the inequality constraint will induce complementarity constraints ($\mu \cdot (\log |\mathbf{I} + \mathbf{FA} | - \xi) =0$), which need to be resolved algorithmically. – Gilead Dec 26 2010 at 2:32
$\mathbf{F}$ and $\mathbf{C}$ are meant to be herminitian. Yes, being rigourous the optimization problem is $\min_{A} \log | \mathbf{I} + \mathbf{FA}|$ subject to $\log | \mathbf{I} + \mathbf{CA}| \geq \epsilon$ and also $\mathbf{A}$ being semidefinite positive. Can this problem be casted as a convex problem? Ok about the closed form solution. Thanks, Mikitov – mikitov Dec 26 2010 at 10:31

1
Off-hand, it seems to me that the problem is convex only if $\mathbf{I}+\mathbf{CA}\succ\mathbf{0}$ and $\mathbf{I}+\mathbf{FA}\prec\mathbf{0}$. If that is the case, you may be able to pose this as some kind of semidefinite program -- but that takes me out of my province. – Gilead Dec 26 2010 at 22:00
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 15, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9324663281440735, "perplexity_flag": "head"}