Optimization problems with L^(1)-control cost functional subject to an elliptic partial differential equation(PDE)are considered.However,different from the finite dimensiona l^(1)-regularization optimization,the resul...Optimization problems with L^(1)-control cost functional subject to an elliptic partial differential equation(PDE)are considered.However,different from the finite dimensiona l^(1)-regularization optimization,the resulting discretized L^(1)norm does not have a decoupled form when the standard piecewise linear finite element is employed to discretize the continuous problem.A common approach to overcome this difficulty is employing a nodal quadrature formula to approximately discretize the L^(1)-norm.In this paper,a new discretized scheme for the L^(1)-norm is presented.Compared to the new discretized scheme for L^(1)-norm with the nodal quadrature formula,the advantages of our new discretized scheme can be demonstrated in terms of the order of approximation.Moreover,finite element error estimates results for the primal problem with the new discretized scheme for the L^(1)-norm are provided,which confirms that this approximation scheme will not change the order of error estimates.To solve the new discretized problem,a symmetric Gauss-Seidel based majorized accelerated block coordinate descent(sGS-mABCD)method is introduced to solve it via its dual.The proposed sGS-mABCD algorithm is illustrated at two numerical examples.Numerical results not only confirm the finite element error estimates,but also show that our proposed algorithm is efficient.展开更多
文摘Optimization problems with L^(1)-control cost functional subject to an elliptic partial differential equation(PDE)are considered.However,different from the finite dimensiona l^(1)-regularization optimization,the resulting discretized L^(1)norm does not have a decoupled form when the standard piecewise linear finite element is employed to discretize the continuous problem.A common approach to overcome this difficulty is employing a nodal quadrature formula to approximately discretize the L^(1)-norm.In this paper,a new discretized scheme for the L^(1)-norm is presented.Compared to the new discretized scheme for L^(1)-norm with the nodal quadrature formula,the advantages of our new discretized scheme can be demonstrated in terms of the order of approximation.Moreover,finite element error estimates results for the primal problem with the new discretized scheme for the L^(1)-norm are provided,which confirms that this approximation scheme will not change the order of error estimates.To solve the new discretized problem,a symmetric Gauss-Seidel based majorized accelerated block coordinate descent(sGS-mABCD)method is introduced to solve it via its dual.The proposed sGS-mABCD algorithm is illustrated at two numerical examples.Numerical results not only confirm the finite element error estimates,but also show that our proposed algorithm is efficient.
