Answers are grounded in this paper and cite their sources.
An algorithm for minimizing the largest eigenvalue of an affine combination of symmetric matrices is presented. The nonsmooth problem is transformed into an equivalent smooth constrained problem, which is solved by a predictor-corrector interior-point method taking full advantage of the differentiability and convexity. Some promising numerical results obtained from a preliminary implementation are included.
No takes yet. Share an insight, caveat, or question.
Florian Jarre (1993) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: