Toggle navigation
Logout
Change account settings
EN
DE
ES
FR
A-Z
Beta
About EconBiz
News
Thesaurus (STW)
Academic Skills
Help
EN
DE
ES
FR
My account
Logout
Change account settings
Login
Publications
Events
Your search terms
Search
Search options
All Fields
Title
Exact title
Subject
Author
Institution
ISBN/ISSN
Published in...
Publisher
Open Access only
Advanced
Search history
My EconBiz
Favorites
Loans
Reservations
Fines
You are here:
Home
Search: subject:"Fathi and Murty problems"
Narrow search
Narrow search
Year of publication
From:
To:
Subject
All
Algorithm
1
Algorithmus
1
Fathi and Murty problems
1
Globalization
1
Harker and Pang algorithm
1
Iterative complexity
1
Line search
1
Linear complementarity problem
1
Mathematical programming
1
Mathematische Optimierung
1
Newton-min algorithm
1
Nondegenerate matrix
1
P-matrix
1
Semismooth Newton method
1
Theorie
1
Theory
1
more ...
less ...
Online availability
All
Undetermined
1
Type of publication
All
Article
1
Type of publication (narrower categories)
All
Article in journal
1
Aufsatz in Zeitschrift
1
Language
All
English
1
Author
All
Dussault, Jean-Pierre
1
Frappier, Mathieu
1
Gilbert, Jean Charles
1
Published in...
All
EURO journal on computational optimization
1
Source
All
ECONIS (ZBW)
1
Showing
1
-
1
of
1
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
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
Dussault, Jean-Pierre
;
Frappier, Mathieu
;
Gilbert, Jean …
- In:
EURO journal on computational optimization
7
(
2019
)
4
,
pp. 359-380
Persistent link: https://ebvufind01.dmz1.zbw.eu/10012314123
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
