Abstarct: This paper focuses on the computation issue of portfolio optimization with scenariobaxsed CVaR. According to the semismoothness of the studied models, a smoothing technology is considered, and a smoothing SQP algorithm then is presented. The global convergence of the algorithm is established. Numerical examples arising from the allocation of generation assets in power markets are done. The computation efficiency between the proposed method and the linear programming (LP) method is compared. Numerical results show that the performance of the new approach is very good. The remarkable characteristic of the new method is threefold. First, the dimension of smoothing models for portfolio optimization with scenario-baxsed CVaR is low and is independent of the number of samples. Second, the smoothing models retain the convexity of original portfolio optimization problems. Third, the complicated smoothing model that maximizes the profit under the CVaR constraint can be reduced to an ordinary optimization model equivalently. All of these show the advantage of the new method to improve the computation efficiency for solving portfolio optimization problems with CVaR measure.