An optimal algorithm with Barzilai-Borwein steplength and superrelaxation for QPQC problem

Pospíšil, Lukáš

  • Programs and Algorithms of Numerical Mathematics, Publisher: Institute of Mathematics AS CR(Prague), page 155-161

Abstract

top
We propose a modification of MPGP algorithm for solving minimizing problem of strictly convex quadratic function subject to separable spherical constraints. This active set based algorithm explores the faces by the conjugate gradients and changes the active sets and active variables by the gradient projection with the Barzilai-Borwein steplength. We show how to use the algorithm for the solution of separable and equality constraints. The power of our modification is demonstrated on the solution of a contact problem with Tresca friction.

How to cite

top

Pospíšil, Lukáš. "An optimal algorithm with Barzilai-Borwein steplength and superrelaxation for QPQC problem." Programs and Algorithms of Numerical Mathematics. Prague: Institute of Mathematics AS CR, 2013. 155-161. <http://eudml.org/doc/271325>.

@inProceedings{Pospíšil2013,
abstract = {We propose a modification of MPGP algorithm for solving minimizing problem of strictly convex quadratic function subject to separable spherical constraints. This active set based algorithm explores the faces by the conjugate gradients and changes the active sets and active variables by the gradient projection with the Barzilai-Borwein steplength. We show how to use the algorithm for the solution of separable and equality constraints. The power of our modification is demonstrated on the solution of a contact problem with Tresca friction.},
author = {Pospíšil, Lukáš},
booktitle = {Programs and Algorithms of Numerical Mathematics},
keywords = {conjugate gradients; Barzilai-Borwein steplength; contact mechanics},
location = {Prague},
pages = {155-161},
publisher = {Institute of Mathematics AS CR},
title = {An optimal algorithm with Barzilai-Borwein steplength and superrelaxation for QPQC problem},
url = {http://eudml.org/doc/271325},
year = {2013},
}

TY - CLSWK
AU - Pospíšil, Lukáš
TI - An optimal algorithm with Barzilai-Borwein steplength and superrelaxation for QPQC problem
T2 - Programs and Algorithms of Numerical Mathematics
PY - 2013
CY - Prague
PB - Institute of Mathematics AS CR
SP - 155
EP - 161
AB - We propose a modification of MPGP algorithm for solving minimizing problem of strictly convex quadratic function subject to separable spherical constraints. This active set based algorithm explores the faces by the conjugate gradients and changes the active sets and active variables by the gradient projection with the Barzilai-Borwein steplength. We show how to use the algorithm for the solution of separable and equality constraints. The power of our modification is demonstrated on the solution of a contact problem with Tresca friction.
KW - conjugate gradients; Barzilai-Borwein steplength; contact mechanics
UR - http://eudml.org/doc/271325
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.