Searcharxiv⌕ Search

arXiv subjects

Gue Myung Lee

Publications and source records attributed to Gue Myung Lee.

3 recordsLinked to original sources

Perturbation of monic matrix polynomials

In this paper, we study the stability of matrix polynomials under structured perturbations of their coefficients. More precisely, we consider a family of matrix polynomials \[ P_u(λ)=A_d(u)λ^d+A_{d-1}(u)λ^{d-1}+\cdots+A_0(u), \] whose matrix coefficients depend continuously and semialgebraically on a parameter vector $u\in\mathbb{C}^p$. Assuming that the matrix polynomial is monic, we show that the spectrum, the $\varepsilon$-pseudospectrum, the numerical range, and the joint numerical range associated with $P_u(λ)$ define set-valued maps that are Hölder continuous with respect to the parameter $u$. Moreover, the parameter space $\mathbb{C}^p$ can be decomposed into a finite union of analytic semialgebraic submanifolds such that, on each submanifold, the eigenvalues and the Jordan pairs of $P_u(λ)$ depend analytically on $u$. We also note that most of the results remain valid if the monicity assumption is replaced by the local nonsingularity of the leading coefficient matrix $A_d(u)$. However, the monic setting is adopted throughout the paper in order to simplify the exposition and to avoid additional technical assumptions, which are required in particular for results concerning numerical ranges.

math.RA↗

Existence theorems for optimal solutions in semi-algebraic optimization

Consider the problem of minimizing a lower semi-continuous semi-algebraic function $f \colon \mathbb{R}^n \to \mathbb{R} \cup \{+\infty\}$ on an unbounded closed semi-algebraic set $S \subset \mathbb{R}^n.$ Employing adequate tools of semi-algebraic geometry, we first establish some properties of the tangency variety of the restriction of $f$ on $S.$ Then we derive verifiable necessary and sufficient conditions for the existence of optimal solutions of the problem as well as the boundedness from below and coercivity of the restriction of $f$ on $S.$ We also present a computable formula for the optimal value of the problem.

math.OC↗

Second-order optimality conditions for multiobjective optimization problems with constraints

In this paper, we introduce the second-order subdifferentials for functions which are Gâteaux differentiable on an open set and whose Gâteaux derivative mapping is locally Lipschitz. Based on properties of this kind of second-order subdifferentials and techniques of variational analysis, we derive second-order necessary conditions for weak Pareto efficient solutions of multiobjective programming problems with constraints.

math.OC↗