We present an accelerated projected gradient method for solving a topology optimization problem. Specifically, we consider compliance minimization problem of continua. The proposed has guaranteed convergence to stationary point and is easy implement. By numerical experiments, show that the computational cost lower than optimality criteria method.

A practical algorithm for box-constrained optimization is introduced. The algorithm combines an active-set strategy with spectral projected gradient iterations. In the interior of each face a strategy that deals efficiently with negative curvature is employed. Global convergence results are given. Numerical results are presented.

In this paper, we propose a direct method based on the real Schur factorization for solving the projected Sylvester equation with relatively small size. The algebraic formula of the solution of the projected continuous-time Sylvester equation is presented. The computational cost of the direct method is estimated. Numerical experiments show that this direct method has high accuracy. Keywords—Pro...

A new method used to prove the global convergence of the nonlinear conjugate gradient methods, the spectral method, is presented in this paper, and it is applied to a new conjugate gradient algorithm with sufficiently descent property. By analyzing the descent property, several concrete forms of this algorithm are suggested. Under standard Wolfe line searches, the global convergence of the new ...

In this paper, we address the solution of the symmetric eigenvalue complementarity problem (EiCP) by treating an equivalent reformulation of finding a stationary point of a fractional quadratic program on the unit simplex. The spectral projected-gradient (SPG) method has been recommended to this optimization problem when the dimension of the symmetric EiCP is large and the accuracy of the solut...