We stand with Ukraine  

Neculai Andrei

Orcid: 0009-0007-0091-8662

According to our database1, Neculai Andrei authored at least 34 papers between 1985 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Towards Scalable Multi-View Reconstruction of Geometry and Materials.
[BibTeX]
[DOI]
Carolin Schmitt
,
Bozidar Antic
,
Neculai Andrei
,
Joo Ho Lee
,
Andreas Geiger
IEEE Trans. Pattern Anal. Mach. Intell., December, 2023

2022
A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
Numer. Algorithms, 2022

Probabilistic Compositional Embeddings for Multimodal Image Retrieval.
[BibTeX]
[DOI]
Neculai Andrei
,
Yanbei Chen
,
Zeynep Akata
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, 2022

2020
Diagonal Approximation of the Hessian by Finite Differences for Unconstrained Optimization.
[BibTeX]
[DOI]
Neculai Andrei
J. Optim. Theory Appl., 2020

A double parameter self-scaling memoryless BFGS method for unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
Comput. Appl. Math., 2020

2019
A diagonal quasi-Newton updating method for unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
Numer. Algorithms, 2019

2018
A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues.
[BibTeX]
[DOI]
Neculai Andrei
Numer. Algorithms, 2018

An adaptive scaled BFGS method for unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
Numer. Algorithms, 2018

A Double-Parameter Scaling Broyden-Fletcher-Goldfarb-Shanno Method Based on Minimizing the Measure Function of Byrd and Nocedal for Unconstrained Optimization.
[BibTeX]
[DOI]
Neculai Andrei
J. Optim. Theory Appl., 2018

A double parameter scaled BFGS method for unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
J. Comput. Appl. Math., 2018

2017
Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
Optim. Methods Softw., 2017

Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update.
[BibTeX]
[DOI]
Neculai Andrei
J. Comput. Appl. Math., 2017

2016
An adaptive conjugate gradient algorithm for large-scale unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
J. Comput. Appl. Math., 2016

2015
A new three-term conjugate gradient algorithm for unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
Numer. Algorithms, 2015

2014
An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
Numer. Algorithms, 2014

2013
Another Conjugate Gradient Algorithm with Guaranteed Descent and Conjugacy Conditions for Large-scale Unconstrained Optimization.
[BibTeX]
[DOI]
Neculai Andrei
J. Optim. Theory Appl., 2013

A simple three-term conjugate gradient algorithm for unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
J. Comput. Appl. Math., 2013

On three-term conjugate gradient algorithms for unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
Appl. Math. Comput., 2013

2012
An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
Optim. Methods Softw., 2012

2010
Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
Numer. Algorithms, 2010

New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
J. Comput. Appl. Math., 2010

Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
Eur. J. Oper. Res., 2010

2009
Performance Profiles of Conjugate-Gradient Algorithms for Unconstrained Optimization.
[BibTeX]
[DOI]
Neculai Andrei
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

New Hybrid Conjugate Gradient Algorithms for Unconstrained Optimization.
[BibTeX]
[DOI]
Neculai Andrei
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Another nonlinear conjugate gradient algorithm for unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
Optim. Methods Softw., 2009

Acceleration of conjugate gradient algorithms for unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
Appl. Math. Comput., 2009

2008
Another hybrid conjugate gradient algorithm for unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
Numer. Algorithms, 2008

A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
Appl. Math. Lett., 2008

2007
Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
Optim. Methods Softw., 2007

Scaled conjugate gradient algorithms for unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
Comput. Optim. Appl., 2007

A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
Appl. Math. Lett., 2007

2006
An acceleration of gradient descent algorithm with backtracking for unconstrained optimization.
[BibTeX]
[DOI]
Neculai Andrei
Numer. Algorithms, 2006

1994
Introduction.
[BibTeX]
[DOI]
Neculai Andrei
Comput. Optim. Appl., 1994

1985
Sparse systems: digraph approach of large-scale linear systems theory.
[BibTeX]
[DOI]
Neculai Andrei
PhD thesis, 1985


  Loading...