default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 534 matches
- 2024
- Rashid Ali, Ali Akgül:
A new matrix splitting generalized iteration method for linear complementarity problems. Appl. Math. Comput. 464: 128378 (2024) - Wenxiu Guo, Hua Zheng, Xiaoping Lu, Yongxiong Zhang:
On the two-stage multisplitting iteration methods for linear complementarity problems. Appl. Math. Comput. 475: 128741 (2024) - Yongxiong Zhang, Wenxiu Guo, Hua Zheng, Seakweng Vong:
A relaxed two-step modulus-based matrix synchronous multisplitting iteration method for linear complementarity problems. Comput. Appl. Math. 43(1): 33 (2024) - Dan Wang, Jicheng Li:
Relaxation modulus-based matrix splitting iteration method for vertical linear complementarity problem. J. Comput. Appl. Math. 437: 115430 (2024) - Dongmei Yu, Yifei Yuan, Yiming Zhang, Pan Bao:
Generalized modulus-based matrix splitting algorithm with Anderson acceleration strategy for vertical linear complementarity problems. J. Comput. Appl. Math. 443: 115763 (2024) - Xiaoni Chi, Guoqiang Wang, Goran Lesaja:
Kernel-Based Full-Newton Step Feasible Interior-Point Algorithm for P*(κ )-Weighted Linear Complementarity Problem. J. Optim. Theory Appl. 202(1): 108-132 (2024) - Zsolt Darvay, Petra Renáta Rigó:
New Predictor-Corrector Algorithm for Symmetric Cone Horizontal Linear Complementarity Problems. J. Optim. Theory Appl. 202(1): 50-75 (2024) - Marianna E.-Nagy, Anita Varga:
A New Ai-Zhang Type Interior Point Algorithm for Sufficient Linear Complementarity Problems. J. Optim. Theory Appl. 202(1): 76-107 (2024) - Behrouz Kheirfam:
Complexity Analysis of a Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems. J. Optim. Theory Appl. 202(1): 133-145 (2024) - Mengxiao Fan, Jicheng Li:
The Order-p Tensor Linear Complementarity Problem for Images Deblurring. J. Sci. Comput. 99(2): 45 (2024) - Christian Biefel, Martin Schmidt:
On the relation between affinely adjustable robust linear complementarity and mixed-integer linear feasibility problems. Optim. Lett. 18(5): 1303-1311 (2024) - Zsolt Darvay, Petra Renáta Rigó:
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations. Optim. Lett. 18(2): 615-634 (2024) - Jong-Kyu Lee, You-Young Cho, Jin-Hee Jin, Gyeong-Mi Cho:
A New full-newton step infeasible interior-point method for P*(κ )-linear Complementarity problem. Optim. Lett. 18(4): 943-964 (2024) - Xionghui Zheng, Yong Wang, Zheng-Hai Huang:
A linearized method for solving tensor complementarity problems with implicit Z-tensors. Optim. Lett. 18(5): 1151-1171 (2024) - Cuixia Li, Shiliang Wu:
A two-step new modulus-based matrix splitting method for vertical linear complementarity problem. Optim. Methods Softw. 39(2): 414-430 (2024) - Punit Kumar Yadav, Palpandi Karuppaiah:
On finiteness of the solution set of extended horizontal linear complementarity problem. Oper. Res. Lett. 54: 107112 (2024) - Félix A. Miranda-Villatoro, Fernando Castaños, Alessio Franci:
Equivalence of Linear Complementarity Problems: Theory and Application to Nonsmooth Bifurcations. IEEE Trans. Autom. Control. 69(7): 4570-4582 (2024) - 2023
- Yongxiong Zhang, Hua Zheng, Xiaoping Lu, Seakweng Vong:
Modulus-based synchronous multisplitting iteration methods without auxiliary variable for solving vertical linear complementarity problems. Appl. Math. Comput. 458: 128248 (2023) - Yongxiong Zhang, Hua Zheng, Seakweng Vong, Xiaoping Lu:
A two-step parallel iteration method for large sparse horizontal linear complementarity problems. Appl. Math. Comput. 438: 127609 (2023) - Wenxiu Guo, Hua Zheng, Xiaofei Peng:
New convergence results of the modulus-based methods for vertical linear complementarity problems. Appl. Math. Lett. 135: 108444 (2023) - Dan Wang, Jicheng Li:
The nonlinear lopsided PSS-like and HSS-like modulus-based matrix splitting iteration methods for horizontal linear complementarity problem. Comput. Appl. Math. 42(7): 299 (2023) - Tibor Illés, Petra Renáta Rigó, Roland Török:
Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation. EURO J. Comput. Optim. 11: 100072 (2023) - Zhengge Huang, Jingjing Cui:
The double-relaxation modulus-based matrix splitting iteration method for linear complementarity problems. J. Comput. Appl. Math. 427: 115138 (2023) - Natasa Krejic, Natasa Krklec Jerinkic, Tijana Ostojic:
An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems. J. Comput. Appl. Math. 423: 114943 (2023) - Cui-Xia Li, Shi-Liang Wu:
Modulus-based matrix splitting methods for complex linear complementarity problem. J. Comput. Appl. Math. 427: 115139 (2023) - Xuezhong Wang, Ping Wei, Yimin Wei:
A Fixed Point Iterative Method for Third-order Tensor Linear Complementarity Problems. J. Optim. Theory Appl. 197(1): 334-357 (2023) - Punit Kumar Yadav, Palpandi Karuppaiah:
Generalizations of R0 and bfSSM Properties for Extended Horizontal Linear Complementarity Problem. J. Optim. Theory Appl. 199(1): 392-414 (2023) - Jean-Pierre Dussault, Jean Charles Gilbert:
Exact computation of an error bound for the balanced linear complementarity problem with unique solution. Math. Program. 199(1): 1221-1238 (2023) - Si-Wei Liao, Guo-Feng Zhang, Zhao-Zheng Liang, Tim B. Swartz:
A preconditioned general modulus-based matrix splitting iteration method for solving horizontal linear complementarity problems. Numer. Algorithms 93(2): 919-947 (2023) - Hua Zheng, Yongxiong Zhang, Xiaoping Lu, Seakweng Vong:
Modulus-based synchronous multisplitting iteration methods for large sparse vertical linear complementarity problems. Numer. Algorithms 93(2): 711-729 (2023)
skipping 504 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-25 17:49 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint