Sparse systems: digraph approach of large-scale linear systems theory. - Neculai Andrei (Verlag TÜV Rheinland, 1985)

Introduction. - Neculai Andrei (Comput. Optim. Appl., 1994)

An acceleration of gradient descent algorithm with backtracking for unconstrained optimization. - Neculai Andrei (Numer. Algorithms, 2006)

A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. - Neculai Andrei (Appl. Math. Lett., 2007)

Scaled conjugate gradient algorithms for unconstrained optimization. - Neculai Andrei (Comput. Optim. Appl., 2007)

Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. - Neculai Andrei (Optim. Methods Softw., 2007)

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

Another hybrid conjugate gradient algorithm for unconstrained optimization. - Neculai Andrei (Numer. Algorithms, 2008)

Acceleration of conjugate gradient algorithms for unconstrained optimization. - Neculai Andrei (Appl. Math. Comput., 2009)

Another nonlinear conjugate gradient algorithm for unconstrained optimization. - Neculai Andrei (Optim. Methods Softw., 2009)

New Hybrid Conjugate Gradient Algorithms for Unconstrained Optimization. - Neculai Andrei (Encyclopedia of Optimization, 2009)

Performance Profiles of Conjugate-Gradient Algorithms for Unconstrained Optimization. - Neculai Andrei (Encyclopedia of Optimization, 2009)

Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. - Neculai Andrei (Eur. J. Oper. Res., 2010)

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

Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization. - Neculai Andrei (Numer. Algorithms, 2010)

An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization. - Neculai Andrei (Optim. Methods Softw., 2012)

On three-term conjugate gradient algorithms for unconstrained optimization. - Neculai Andrei (Appl. Math. Comput., 2013)

A simple three-term conjugate gradient algorithm for unconstrained optimization. - Neculai Andrei (J. Comput. Appl. Math., 2013)

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

An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization. - Neculai Andrei (Numer. Algorithms, 2014)

A new three-term conjugate gradient algorithm for unconstrained optimization. - Neculai Andrei (Numer. Algorithms, 2015)

An adaptive conjugate gradient algorithm for large-scale unconstrained optimization. - Neculai Andrei (J. Comput. Appl. Math., 2016)

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

Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization. - Neculai Andrei (Optim. Methods Softw., 2017)

A double parameter scaled BFGS method for unconstrained optimization. - Neculai Andrei (J. Comput. Appl. Math., 2018)

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

An adaptive scaled BFGS method for unconstrained optimization. - Neculai Andrei (Numer. Algorithms, 2018)

A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues. - Neculai Andrei (Numer. Algorithms, 2018)

A diagonal quasi-Newton updating method for unconstrained optimization. - Neculai Andrei (Numer. Algorithms, 2019)

A double parameter self-scaling memoryless BFGS method for unconstrained optimization. - Neculai Andrei (Comput. Appl. Math., 2020)

Diagonal Approximation of the Hessian by Finite Differences for Unconstrained Optimization. - Neculai Andrei (J. Optim. Theory Appl., 2020)

Probabilistic Compositional Embeddings for Multimodal Image Retrieval. - Neculai Andrei; Yanbei Chen; Zeynep Akata (CVPR Workshops, 2022)

A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization. - Neculai Andrei (Numer. Algorithms, 2022)

Towards Scalable Multi-View Reconstruction of Geometry and Materials. - Carolin Schmitt; Bozidar Antic; Neculai Andrei; Joo Ho Lee 003; Andreas Geiger 001 (IEEE Trans. Pattern Anal. Mach. Intell., 2023)