We present an implementable algorithm for solving constrained optmization problems defined by functions that are not everywhere differentiable. The method is based on combining, modifying and ...

In this paper, we aim to find ecient solutions of a multi-objective optimization problem over a linear matrix inequality (LMI in short), in which the objective functions are SOS-convex polynomials. We ...