The projected Barzilai–Borwein method with fall-back for strictly convex QCQP problems with separable constraints

Lukáš Pospíšil and Zdeněk Dostál

Mathematics and Computers in Simulation (MATCOM), 2018, vol. 145, issue C, 79-89

Abstract: A variant of the projected Barzilai–Borwein method for solving the strictly convex QCQP problems with separable constraints is presented. The convergence is enforced by a combination of the fall-back strategy and the fixed step-length gradient projection. Using the recent results on the decrease of the convex quadratic function along the projected-gradient path, we prove that the algorithm enjoys the R-linear convergence. The algorithm is plugged into our scalable TFETI based domain decomposition algorithm for the solution of contact problems and its performance is demonstrated on the solution of contact problems, including a frictionless problem and the problems with the isotropic and orthotropic Tresca friction.

Keywords: Quadratic programming; Separable constraints; QCQP; Barzilai–Borwein with fall-back (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475417303415
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:145:y:2018:i:c:p:79-89

DOI: 10.1016/j.matcom.2017.10.003

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().