Proportionality-Based Gradient Methods with Applications in Contact Mechanics
Two proportionality based gradient methods for the solution of large convex bound constrained quadratic programming problems, MPRGP (Modified Proportioning with Reduced Gradient Projections) and P2GP (Proportionality-based Two-phase Gradient Projection) are presented and applied to the solution of auxiliary problems in the inner loop of an augmented lagrangian algorithm called SMALBE (Semi-monotonic Augmented Lagrangian for Bound and Equality constraints). The SMALBE algorithm is used to generate the Lagrange multipliers for the equality constraints. The performance of the algorithms is tested on the solution of the discretized contact problems by means of TFETI (Total Finite Element Tearing and Interconnecting).
KeywordsQP optimization Contact problems P2GP MPRGP
This work was supported by The Ministry of Education, Youth and Sports from the National Programme of Sustainability (NPS II) project “IT4Innovations excellence in science - LQ1602” and by the IT4Innovations infrastructure which is supported from the Large Infrastructures for Research, Experimental Development and Innovations project “IT4Innovations National Supercomputing Center - LM2015070”. The work was partially supported by Gruppo Nazionale per il Calcolo Scientifico - Istituto Nazionale di Alta Matematica (GNCS-INdAM).
- 3.Bielschowski, R.H., Friedlander, A., Gomes, F.A.M., Martínez, J.M., Raydan, M.: An adaptive algorithm for bound constrained quadratic minimization. Invest. Oper. 7, 67–102 (1997)Google Scholar
- 8.di Serafino, D., Ruggiero, V., Toraldo, G., Zanni, L.: On the steplength selection in gradient methods for unconstrained optimization. Appl. Math. Comput. (2017). https://doi.org/10.1016/j.amc.2017.07.037
- 9.di Serafino, D., Toraldo, G., Viola, M., Barlow, J.: A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables. SIAM Journal on Optimization (2018, to appear)Google Scholar