A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	EURO journal on computational optimization
1. Verfasser:	Dussault, Jean-Pierre (VerfasserIn)
Weitere Verfasser:	Frappier, Mathieu (VerfasserIn), Gilbert, Jean Charles (VerfasserIn)
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2019
Schlagworte:	Iterative complexity > Linear complementarity problem > Fathi and Murty problems > Globalization > Harker and Pang algorithm > Line search > Newton-min algorithm > Nondegenerate matrix > P-matrix > Semismooth Newton method > Aufsatz in Zeitschrift
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Band
Special issue: bilevel optimization	2020	volume 8, number 1 (March 2020)
Special issue: computational discrete optimization	2020	volume 8, numbers 3/4 (October 2020)
Special issue on robust combinatorial optimization	2018	volume 6, number 3, (September 2018)
Special issue on robust combinatorial optimization : Part II	2018	volume 6, number 4, (Dezember 2018)
Special issue on "Nonlinear and combinatorial methods for energy optimization"	2017	volume 5, number 1-2, (March 2017)
Special issue on non-linear continuous optimization	2016	volume 4, number 1, February 2016
Special Issue on "Computational Optimization Methods in Telecommunications"	2016	volume 4, number 2, May 2016
Special issue on disaster risk management	2016	volume 4, numbers 3/4, (September 2016)
Special issue on applied bilevel programming	2015	3.2015,3
Special issue on "matheuristics"	2014	2.2014,4
Special issue on computational methods for network optimization problems Pt. 2	2014	2.2014,1/2
Special issue on computational methods for network optimization problems Pt. 1	2013	1.2013,3/4