default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNeculai Andrei
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j30]Carolin Schmitt
, Bozidar Antic, Neculai Andrei, Joo Ho Lee, Andreas Geiger:
Towards Scalable Multi-View Reconstruction of Geometry and Materials. IEEE Trans. Pattern Anal. Mach. Intell. 45(12): 15850-15869 (2023)- [i2]Carolin Schmitt, Bozidar Antic, Neculai Andrei, Joo Ho Lee, Andreas Geiger:
Towards Scalable Multi-View Reconstruction of Geometry and Materials. CoRR abs/2306.03747 (2023) - 2022
- [j29]Neculai Andrei:
A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization. Numer. Algorithms 90(1): 223-240 (2022) - [c1]Neculai Andrei, Yanbei Chen, Zeynep Akata:
Probabilistic Compositional Embeddings for Multimodal Image Retrieval. CVPR Workshops 2022: 4546-4556 - [i1]Neculai Andrei, Yanbei Chen, Zeynep Akata:
Probabilistic Compositional Embeddings for Multimodal Image Retrieval. CoRR abs/2204.05845 (2022) - 2020
- [j28]Neculai Andrei:
A double parameter self-scaling memoryless BFGS method for unconstrained optimization. Comput. Appl. Math. 39(3) (2020) - [j27]Neculai Andrei:
Diagonal Approximation of the Hessian by Finite Differences for Unconstrained Optimization. J. Optim. Theory Appl. 185(3): 859-879 (2020)
2010 – 2019
- 2019
- [j26]Neculai Andrei:
A diagonal quasi-Newton updating method for unconstrained optimization. Numer. Algorithms 81(2): 575-590 (2019) - 2018
- [j25]Neculai Andrei:
A double parameter scaled BFGS method for unconstrained optimization. J. Comput. Appl. Math. 332: 26-44 (2018) - [j24]Neculai Andrei:
A Double-Parameter Scaling Broyden-Fletcher-Goldfarb-Shanno Method Based on Minimizing the Measure Function of Byrd and Nocedal for Unconstrained Optimization. J. Optim. Theory Appl. 178(1): 191-218 (2018) - [j23]Neculai Andrei:
An adaptive scaled BFGS method for unconstrained optimization. Numer. Algorithms 77(2): 413-432 (2018) - [j22]Neculai Andrei:
A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues. Numer. Algorithms 77(4): 1273-1282 (2018) - 2017
- [j21]Neculai Andrei:
Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update. J. Comput. Appl. Math. 325: 149-164 (2017) - [j20]Neculai Andrei:
Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization. Optim. Methods Softw. 32(3): 534-551 (2017) - 2016
- [j19]Neculai Andrei:
An adaptive conjugate gradient algorithm for large-scale unconstrained optimization. J. Comput. Appl. Math. 292: 83-91 (2016) - 2015
- [j18]Neculai Andrei:
A new three-term conjugate gradient algorithm for unconstrained optimization. Numer. Algorithms 68(2): 305-321 (2015) - 2014
- [j17]Neculai Andrei:
An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization. Numer. Algorithms 65(4): 859-874 (2014) - 2013
- [j16]Neculai Andrei:
On three-term conjugate gradient algorithms for unconstrained optimization. Appl. Math. Comput. 219(11): 6316-6327 (2013) - [j15]Neculai Andrei:
A simple three-term conjugate gradient algorithm for unconstrained optimization. J. Comput. Appl. Math. 241: 19-29 (2013) - [j14]Neculai Andrei:
Another Conjugate Gradient Algorithm with Guaranteed Descent and Conjugacy Conditions for Large-scale Unconstrained Optimization. J. Optim. Theory Appl. 159(1): 159-182 (2013) - 2012
- [j13]Neculai Andrei:
An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization. Optim. Methods Softw. 27(4-5): 583-604 (2012) - 2010
- [j12]Neculai Andrei:
Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. Eur. J. Oper. Res. 204(3): 410-420 (2010) - [j11]Neculai Andrei:
New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization. J. Comput. Appl. Math. 234(12): 3397-3410 (2010) - [j10]Neculai Andrei:
Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization. Numer. Algorithms 54(1): 23-46 (2010)
2000 – 2009
- 2009
- [j9]Neculai Andrei:
Acceleration of conjugate gradient algorithms for unconstrained optimization. Appl. Math. Comput. 213(2): 361-369 (2009) - [j8]Neculai Andrei:
Another nonlinear conjugate gradient algorithm for unconstrained optimization. Optim. Methods Softw. 24(1): 89-104 (2009) - [r2]Neculai Andrei:
New Hybrid Conjugate Gradient Algorithms for Unconstrained Optimization. Encyclopedia of Optimization 2009: 2560-2571 - [r1]Neculai Andrei:
Performance Profiles of Conjugate-Gradient Algorithms for Unconstrained Optimization. Encyclopedia of Optimization 2009: 2938-2953 - 2008
- [j7]Neculai Andrei:
A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization. Appl. Math. Lett. 21(2): 165-171 (2008) - [j6]Neculai Andrei:
Another hybrid conjugate gradient algorithm for unconstrained optimization. Numer. Algorithms 47(2): 143-156 (2008) - 2007
- [j5]Neculai Andrei:
A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. Appl. Math. Lett. 20(6): 645-650 (2007) - [j4]Neculai Andrei:
Scaled conjugate gradient algorithms for unconstrained optimization. Comput. Optim. Appl. 38(3): 401-416 (2007) - [j3]Neculai Andrei:
Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. Optim. Methods Softw. 22(4): 561-571 (2007) - 2006
- [j2]Neculai Andrei:
An acceleration of gradient descent algorithm with backtracking for unconstrained optimization. Numer. Algorithms 42(1): 63-73 (2006)
1990 – 1999
- 1994
- [j1]Neculai Andrei:
Introduction. Comput. Optim. Appl. 3(4): 287-288 (1994)
1980 – 1989
- 1985
- [b1]Neculai Andrei:
Sparse systems: digraph approach of large-scale linear systems theory. Politehnica University of Bucharest, Romania, Verlag TÜV Rheinland 1985, ISBN 978-3-88585-237-7, pp. 1-254
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-07-26 19:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
