![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Rupaj Kumar Nayak
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j7]Nirmalya Kumar Mohanty, Rupaj Kumar Nayak
:
A survey on update parameters of nonlinear conjugate gradient methods. Int. J. Math. Model. Numer. Optimisation 11(3): 292-325 (2021) - [i2]Yash Pratyush Sinha, Pranshu Malviya, Rupaj Kumar Nayak:
Fast constraint satisfaction problem and learning-based algorithm for solving Minesweeper. CoRR abs/2105.04120 (2021) - [i1]V. N. Aditya Datta Chivukula, Rupaj Kumar Nayak:
The impact of the additional features on the performance of regression analysis: a case study on regression analysis of music signal. CoRR abs/2105.05938 (2021) - 2020
- [j6]Nirmalya Kumar Mohanty, Rupaj Kumar Nayak
:
A new efficient hybrid conjugate gradient method based on LS-DY-HS conjugate gradient parameter. Int. J. Math. Model. Numer. Optimisation 10(4): 342-364 (2020) - [j5]Rupaj Kumar Nayak
, Nirmalya Kumar Mohanty:
Solution of boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation. J. Comb. Optim. 39(3): 792-825 (2020)
2010 – 2019
- 2019
- [j4]Rupaj Kumar Nayak
, Nirmalya Kumar Mohanty:
Improved row-by-row method for binary quadratic optimization problems. Ann. Oper. Res. 275(2): 587-605 (2019) - 2018
- [j3]Rupaj Kumar Nayak
, Mahendra Prasad Biswal:
A low complexity semidefinite relaxation for large-scale MIMO detection. J. Comb. Optim. 35(2): 473-492 (2018) - 2016
- [j2]Rupaj Kumar Nayak
, Jitamitra Desai:
A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem. Optim. Lett. 10(7): 1417-1448 (2016) - 2010
- [j1]Rupaj Kumar Nayak
, Mahendra Prasad Biswal, S. Padhy:
Modification of Karmarkar's projective scaling algorithm. Appl. Math. Comput. 216(1): 227-235 (2010)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
last updated on 2024-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint