A new active-set method for smooth box-constrained minimization is introduced. The algorithm combines an unconstrained method, including a new line-search which aims to add many constraints to the working set at a single iteration, with a recently introduced technique (spectral projected gradient) for dropping constraints from the working set. Global convergence is proved. A computer implementa...

Abstract We present an inertial projected gradient method for solving large-scale topology optimization problems. consider the compliance minimization problem, heat conduction problem and compliant mechanism of continua. use to efficiently treat linear constraints these Also, techniques are used accelerate convergence method. adaptive step size policy further reduce computational cost. The prop...

Recently there has been an increasing interest in primal-dual methods for model predictive control (MPC), which require minimizing the (augmented) Lagrangian at each iteration. We propose a novel first order method, termed proportional-integral projected gradient MPC where underlying finite horizon optimal problem both state and input constraints. Instead of Lagrangian, iteration our method onl...

Community detection plays an important role in understanding and exploiting the structure of complex systems. Many algorithms have been developed for community using modularity maximization or other techniques. In this paper, we formulate problem as a constrained nonsmooth optimization on compact Stiefel manifold. A Riemannian projected proximal gradient method is proposed used to solve problem...

Gradient projection methods based on the Barzilai-Borwein spectral steplength choices are considered for quadratic programming problems with simple constraints. Well known nonmonotone spectral projected gradient methods and variable projection methods are discussed. For both approaches the behavior of different combinations of the two spectral steplengths is investigated. A new adaptive stpleng...

Gradient projection methods based on the Barzilai-Borwein spectral steplength choices are considered for quadratic programming problems with simple constraints. Well-known nonmonotone spectral projected gradient methods and variable projection methods are discussed. For both approaches the behavior of different combinations of the two spectral steplengths is investigated. A new adaptive steplen...