Averaged Mappings and the Gradient-Projection Algorithm

2011 ◽  
Vol 150 (2) ◽  
pp. 360-378 ◽  
Author(s):  
Hong-Kun Xu
2012 ◽  
Vol 2012 ◽  
pp. 1-14
Author(s):  
Ming Tian ◽  
Min-Min Li

It is well known that the gradient-projection algorithm (GPA) is very useful in solving constrained convex minimization problems. In this paper, we combine a general iterative method with the gradient-projection algorithm to propose a hybrid gradient-projection algorithm and prove that the sequence generated by the hybrid gradient-projection algorithm converges in norm to a minimizer of constrained convex minimization problems which solves a variational inequality.


Author(s):  
Ihar Antonau ◽  
Majid Hojjat ◽  
Kai-Uwe Bletzinger

AbstractIn node-based shape optimization, there are a vast amount of design parameters, and the objectives, as well as the physical constraints, are non-linear in state and design. Robust optimization algorithms are required. The methods of feasible directions are widely used in practical optimization problems and know to be quite robust. A subclass of these methods is the gradient projection method. It is an active-set method, it can be used with equality and non-equality constraints, and it has gained significant popularity for its intuitive implementation. One significant issue around efficiency is that the algorithm may suffer from zigzagging behavior while it follows non-linear design boundaries. In this work, we propose a modification to Rosen’s gradient projection algorithm. It includes the efficient techniques to damp the zigzagging behavior of the original algorithm while following the non-linear design boundaries, thus improving the performance of the method.


2012 ◽  
Vol 2012 ◽  
pp. 1-9 ◽  
Author(s):  
Yonghong Yao ◽  
Shin Min Kang ◽  
Wu Jigang ◽  
Pei-Xia Yang

We investigate the following regularized gradient projection algorithmxn+1=Pc(I−γn(∇f+αnI))xn,n≥0. Under some different control conditions, we prove that this gradient projection algorithm strongly converges to the minimum norm solution of the minimization problemminx∈Cf(x).


Sign in / Sign up

Export Citation Format

Share Document