NECULAI ANDREI Home Page

 

Technical Reports

        N. Andrei, Accelerated memory-less SR1 method with generalized secant equation for unconstrained optimization. Technical Report 9/2021, May 28, 2021 (20 pages)

        N. Andrei, Accelerated memory-less SR1 with generalized secant equation method for unconstrained optimization. Technical Report 8/2021, May 26, 2021 (18 pages)

        N. Andrei, Memory-less SR1 and memory-less BFGS methods for unconstrained optimization. Technical Report 7/2021, May 18, 2021 (17 pages)

        N. Andrei, Accelerated Modified Memory-less SR1 Method with Cubic Regularization for Unconstrained Optimization. Technical Report 6/2021, April 28, 2021 (28 pages)

        N. Andrei, Accelerated Scaled Memory-less SR1 method for Unconstrained Optimization. Technical Report 5/2021, April 9, 2021 (22 pages)

        N. Andrei, More on the efficiency and robustness of conjugate gradient methods subject to procedures for stepsize computation. Technical Report 4/2021, March 11, 2021 (29 pages)

        N. Andrei, Variants of the Dai-Liao conjugate gradient method for unconstrained optimization. Technical Report 3/2021, January 19, 2021 (14 pages)

        N. Andrei, Efficiency and robustness of conjugate gradient methods subject to the procedures for stepsize computation. Technical Report 2/2021, January 11, 2021 (14 pages)

        N. Andrei, Variants of the conjugate gradient algorithm with guaranteed descent and conjugacy conditions and a modified Wolfe line search DESCON for large-scale unconstrained optimization. Technical Report 1/2021, January 4, 2021 (6 pages)

        N. Andrei, Acceleration by modifying the stepsize versus preconditioning with diagonalized quasi-Newton of the self-scaling memoryless BFGS conjugate gradient methods of Hager-Zhang and Dai-Kou. Technical Report 21/2020, October 14, 2020 (20 pages)

        N. Andrei, Numerical experiments with L-BFGS for solving 14 applications of unconstrained optimization. AOSR – Academy of Romanian Scientists, Bucharest, Romania, Technical Report No.18/2020, June 6, 2020. (Romanian Academy Library) (10 pages)

        N. Andrei, Comparison of modern conjugate gradient methods: DESCON, CUBIC, CG-DESCENT (4.1) for solving 14 small-scale applications of unconstrained optimization. AOSR – Academy of Romanian Scientists, Bucharest, Romania, Technical Report No.17/2020, June 4, 2020. (Romanian Academy Library) (8 pages)

        N. Andrei, Numerical experiments with CG-DESCENT for solving 14 applications of unconstrained optimization. AOSR – Academy of Romanian Scientists, Bucharest, Romania, Technical Report No.16/2020, June 4, 2020. (Romanian Academy Library) (10 pages)

        N. Andrei, Numerical experiments with CUBIC for solving 14 applications of unconstrained optimization. AOSR – Academy of Romanian Scientists, Bucharest, Romania, Technical Report No.15/2020, June 3, 2020. (Romanian Academy Library) (11 pages)

        N. Andrei,Numerical experiments with DESCON for solving 14 applications of unconstrained optimization. AOSR – Academy of Romanian Scientists, Bucharest, Romania, Technical Report No.14/2020, June 3, 2020. (Romanian Academy Library) (10 pages)

        N. Andrei, Comparison Between the Performances of DEEPS and Nelder-Mead for solving 120 Unconstrained Optimization Problems. AOSR – Academy of Romanian Scientists, Bucharest, Romania, Technical Report No.12/2020, May 12, 2020. (Romanian Academy Library) (6 pages)

        N. Andrei, Performances of DEEPS for solving 120 Unconstrained Optimization Problems. AOSR – Academy of Romanian Scientists, Bucharest, Romania, Technical Report 11/2020, May 10, 2020. (Romanian Academy Library) (3 pages)

        N. Andrei, A two level random search method for solving the Elastic Plastic Torsion from MINPACK2. AOSR – Academy of Romanian Scientists, Bucharest, Romania, Technical Report 10/2020, April 23, 2020. (Romanian Academy Library) (3 pages)

        N. Andrei, A two level random search method for unconstrained optimization. AOSR – Academy of Romanian Scientists, Bucharest, Romania, Technical Report 9/2020, April 19, 2020. (Romanian Academy Library) (46 pages)

        N. Andrei, A simple deep random search method for unconstrained optimization. AOSR – Academy of Romanian Scientists, Bucharest, Romania, Technical Report 8/2020, April 8, 2020. (Romanian Academy Library) (27 pages)

        N. Andrei, Solution of Human Heart Dipole unconstrained optimization problem by means of DEESP6 and Nelder-Mead methods. AOSR – Academy of Romanian Scientists, Bucharest, Romania, Technical Report 7/2020, April 1, 2020. (Romanian Academy Library) (11 pages)

        N.Andrei, A new simple deep random search method for unconstrained optimization. Technical Report No.6/2020. AOSR – Academy of Romanian Scientists, Bucharest, Romania, March 27, 2020. (Romanian Academy Library) (45 pages)

        N. Andrei, Performances of DEEPS for solving 16 real applications of unconstrained optimization. Technical Report No.5/2020. AOSR – Academy of Romanian Scientists, Bucharest, Romania, March 23, 2020. (Romanian Academy Library) (20 pages)

        N. Andrei, Performances of DEEPS algorithm for solving large-scale unconstrained optimization problems. Technical Report No.4/2020. AOSR – Academy of Romanian Scientists, Bucharest, Romania, March 22, 2020. (Romanian Academy Library) (10 pages)

        N. Andrei, Influence of local bounds “lobndc” and “upbndc” defining the size of the local domains on performances of the DEEPS algorithm. Technical Report No.3/2020. AOSR – Academy of Romanian Scientists, Bucharest, Romania, March 19, 2020. (Romanian Academy Library) (5 pages)

        N. Andrei, Comparison of DEEPS algorithm using a simple deep random search method versus Steepest Descent for solving an unconstrained optimization problem with a narrow positive cone. Technical Report No.2/2020. AOSR – Academy of Romanian Scientists, Bucharest, Romania, March 18, 2020. (Romanian Academy Library) (3 pages)

        N. Andrei, A simple deep random search method for unconstrained optimization. Preliminary computational results. Technical Report No.1/2020. AOSR – Academy of Romanian Scientists, Bucharest, Romania, February 29, 2020. (Romanian Academy Library) (87 pages)

        N. Andrei, Performances of DESCON, L-BFGS L-CG-DESCENT and of CONOPT, KNITRO, MINOS, IPOPT for solving the problem PALMER1C. Technical Report No.3/2019. AOSR – Academy of Romanian Scientists, Bucharest, Romania, June 9, 2019. (Romanian Academy Library) (16 pages)

        N. Andrei, Conjugate Gradient Algorithms Closest to Self-Scaling Memoryless BFGS Method based on clustering the eigenvalues of the self-scaling memoryless BFGS iteration matrix or on minimizing the Byrd-Nocedal measure function with Different Wolfe Line Searches for Unconstrained Optimization. Technical Report No.2/2019. AOSR – Academy of Romanian Scientists, Bucharest, Romania, April 18, 2019. (119 pages) (Romanian Academy Library)

        N. Andrei, The conjugate gradient method closest to the scaled memoryless BFGS preconditioned with approximate and improved Wolfe line search. Technical Report No.1/2019. AOSR - Academy of Romanian Scientists, Bucharest, Romania, January 28, 2019. (61 pages) (Romanian Academy Library)

        N. Andrei, UOP - A collection of 80 unconstrained optimization problems. ICI Technical Report No.7/2018, November 17, 2018

        N. Andrei, A collection of 75 unconstrained optimization test problems. ICI Technical Report No.6/2018, May 10, 2018

        N. Andrei, A set of unconstrained optimization test problems. ICI Technical Report No.4/2018, May 2, 2018

        N. Andrei, A double parameter scaled modified Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization. Technical Report No.3/2018, April 4, 2018

        N. Andrei, A diagonal quasi-Newton updating method for unconstrained optimization. Technical Report No.2/2018, March 10, 2018

        N. Andrei, A diagonal quasi-Newton updating method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization. Technical Report No. 1/2018, January 31, 2018

        N. Andrei, A double parameter scaled BFGS method for unconstrained optimization. Preliminary computational results. ICI Technical Report, September 11, 2017

        N. Andrei, A scaled BFGS method with two parameters for unconstrained optimization. ICI Technical Report, May 5, 2017

        N. Andrei, An adaptive scaled BFGS method for unconstrained optimization. ICI Technical Report, March 18, 2018

        N. Andrei, Particle Swarm Optimization Method for Engineering Nonlinear Constrained Optimization. ICI Technical Report, March 15, 2017

        N. Andrei, A descent Conjugate Gradient Algorithm with quasi-Newton updates. ICI Technical Report,March 2, 2017

        N. Andrei, Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update ICI Technical Report, January 16, 2017 .

        N. Andrei, A Dai-Liao conjugate gradient algorithm with clustering the eigenvalues. ICI Technical Report, January 4, 2017.

        N. Andrei, Adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update. ICI Technical Report, October 5, 2016.

        N. Andrei, Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization. ICI Technical Report, August 1, 2017

        N. Andrei, An adaptive conjugate gradient algorithm with clustering the singular values of the search direction matrix for large-scale unconstrained optimization. ICI Technical Report, July 18, 2016

        N. Andrei, Solving Linear Equation Systems. ICI Technical Report, June 18, 2016

        N. Andrei, Optimality conditions for continuous nonlinear optimization. ICI Technical Report, January 12, 2016.

        N. Andrei, Descent Conjugate Gradient Algorithm with quasi-Newton updates. ICI Technical Report. November 6, 2015.

        N. Andrei, A new adaptive conjugate gradient algorithm for large-scale unconstrained optimization. ICI Technical Report, June 18, 2015.

        N. Andrei, An adaptive conjugate gradient algorithm for large-scale unconstrained optimization. ICI Technical Report, May 20, 2015.

        N. Andrei, Test functions for unconstrained optimization. ICI Technical Report, June 20, 2013.

        N. Andrei,A numerical study on efficiency and robustness of some conjugate gradient algorithms for large-scale unconstrained optimization. ICI Technical Report, May 22, 2013.

        N. Andrei, Performance of AHYBRIDM, ASCALCG, CG-DESCENT, DESCON and THREECG for solving 5 applications from MINPACK-2. ICI Technical Report, April 3, 2013.

        N. Andrei,Another numerical example for CG_DESCENT conjugate gradient algorithm. ICI Technical Report, January 4, 2013.

        N. Andrei,A numerical example for CG_DESCENT conjugate gradient algorithm. ICI Technical Report, November 15, 2012.

        N. Andrei, DESCON versus CG-DESCENT for solving 5 applications from MINPACK2. ICI Technical Report, September 13, 2012.

        N. Andrei, Some more comparisons of DESCON with different values for the parameter „maxls” versus CG-DESCENT . ICI Technical Report, September 12, 2012.

        N. Andrei, Comparisons: DESCON versus CG-DESCENT. ICI Technical Report, September 10, 2012.

        N. Andrei, CPU time metric comparisons: DESCON, TTS, CG-DESCENT . ICI Technical Report, July 18, 2012.

        N. Andrei, An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization. ICI Technical Report, July 12, 2012.

        N. Andrei, On three-term conjugate gradient algorithms for unconstrained optimization. ICI Technical Report, March 14, 2012.

        N. Andrei, A simple three-term conjugate gradient algorithm for unconstrained optimization. ICI Technical Report, March 6, 2012.

        N. Andrei, WORKS 2011, Bucharest, December 2011. (Romanian Academy Library, with CD)

        N. Andrei, Metoda MINOS, Raport Tehnic ICI, 8 August, 2011

        N. Andrei, UNO: A package for unconstrained optimization methods using direct searching techniques. ICI Technical Report. April 20, 2011.

        N. Andrei, CAON: O Colectie de Aplicatii de Optimizare Neliniara in limbajul GAMS. ICI Technical Report No.1/2011, Ianuarie 31, 2011.

        N. Andrei, WORKS 2010, Bucharest, December 2010. (Romanian Academy Library, with CD)

        N. Andrei, Another accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization, ICI Technical Report, November 29, 2010

        N. Andrei, Performances of SPG for solving MINPACK-2 applications. ICI Technical Report, September 14, 2010

        N. Andrei, Comparison between LBFGS-B and SPG with cubic interpolation in line search. ICI Technical Report, September 1, 2010

        N. Andrei, Comparison between SPG with quadratic interpolation and SPG with cubic interpolation. ICI Technical Report, August 31, 2010

        N. Andrei, Comparison between LBFGS-B and SPG with quadratic interpolation in line search. ICI Technical Report, August 31, 2010

        N. Andrei, O Colectie de Probleme de Programare Liniara. ICI Technical Report, August 15, 2010

        N. Andrei, Comparison LBFGS-B versus LBFGS. ICI Technical Report, August 10, 2010

        N. Andrei, Computational results for LBFGS-B. ICI Technical Report, August 10, 2010

        N. Andrei, Performances of LBFGS-B for solving MINPACK-2 applications. ICI Technical Report, August 9, 2010

        N. Andrei, Another accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization, ICI Technical Report, January 29, 2010

        N. Andrei, New Accelerated Conjugate Gradient Algorithms as modification of Dai-Yuan’s computational scheme for Unconstrained Optimization, ICI Technical Report, January 27, 2010.

        N. Andrei, WORKS 2009, Bucharest, December 2009. (Romanian Academy Library, with CD)

        N. Andrei, Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. ICI Technical Report, July 31, 2009

        N. Andrei, CGALLACC - Accelerated conjugate gradient algorithms for unconstrained optimization. ICI Technical Report No. 17/2009, March 30, 2009. (Romanian Academy Library, with CD)

        N. Andrei, Acceleration of conjugate gradient algorithms for unconstrained optimization. ICI Technical Report No. 16, March 16, 2009

        N. Andrei, Accelated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization. ICI Technical Report No. 14, February 23, 2009

        N. Andrei, Colectie de prototipuri de modele de optimizare neliniara. ICI Technical Report. January 12, 2009

        N. Andrei, WORKS 2008, Bucharest, December 2008. (Romanian Academy Library, with CD)

        N. Andrei, An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization. ICI Technical Report No. 36/08, December 10, 2008.

        N. Andrei, HYBRID, HYBRIDM, AHYBRIDM conjugate gradient algorithms for unconstrained optimization. Technical report No. 35, October 20, 2008. (Romanian Academy Library, with CD)

        N. Andrei, Computational experience with LBFGS - a limited memory BFGS quasi-Newton method for unconstrained optimization. Technical Report No. 32, October 3-14, 2008. (Romanian Academy Library, with CD)

        N. Andrei, Numerical experiments with accelerated hybrid conjugate gradient algorithm with modified secant condition - AHYBRID- for unconstrained optimization. ICI Technical Report No. 30/08, September 24, 2008

        N. Andrei, Numerical experiments with accelerated conjugate gradient algorithm with Hessian / vector product -ACGHES- for unconstrained optimization. ICI Technical Report No. 29/08, September 22, 2008

        N. Andrei, Open Problems in Nonlinear Conjugate Gradient Algorithms for Unconstrained Optimization. ICI Technical Report No. 28/08, July 30, 2008

        N. Andrei, New accelerated conjugate gradient algorithms for unconstrained optimization. ICI Technical Report No. 24/08, June 18, 2008

        N. Andrei, Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization.
ICI Technical Report No. 16/08, March 24, 2008

        N. Andrei, 40 conjugate gradient algorithms for unconstrained optimization. A survey on their definition.
ICI Technical Report No. 13/08, March 14, 2008

        N. Andrei, Performance profiles of line-search algorithms for unconstrained optimization.
ICI Technical Report No. 12/08, March 5, 2008

        N. Andrei, A hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization.
ICI Technical Report No. 3/08, February 6, 2008

        N. Andrei, SCALCG - Scaled Conjugate Gradient Algorithms for Unconstrained Optimization. Technical Report No. 17/2007, March 30, 2007 . (Romanian Academy Library, with CD)

        N. Andrei, SAMO - Tehnologie Informatica Avansata pentru Modelare si Optimizare. Raport Tehnic No. 18/2007, Martie 8, 2007. (Romanian Academy Library, with CD)

        N. Andrei, Another conjugate gradient algorithm for unconstrained optimization.
ICI Technical Report No.28/07, August 12, 2007

        N. Andrei, New hybrid conjugate gradient algorithms for unconstrained optimization.
ICI Technical Report No. 26/07, September 26, 2007

        N. Andrei, Numerical comparison of conjugate gradient algorithms for unconstrained optrimization.
ICI Technical Report No. 29/07, October 10, 2007

        N. Andrei, CGALL - Conjugate Gradient Algorithms for Unconstrained Optimization. Technical Report No. 16/2007, March 5, 2007. (Romanian Academy Library, with CD)

        N. Andrei, WORKS 2007, Bucharest, December 2007. (Romanian Academy Library)

        N. Andrei, WORKS 2006, Bucharest, December 2006. (Romanian Academy Library)

        N. Andrei, WORKS 2005, Bucharest, December 2005. (Romanian Academy Library)

        N. Andrei, WORKS 2004, Bucharest, December 2004. (Romanian Academy Library)

        N. Andrei, Computational experience with SPENBAR - A Sparse Modified Penalty-Barrier Method for Large-Scale Nonlinear, Equality and Inequality, constrained optimization Technical Report No. 4/2001, February 19, 2001. (Romanian Academy Library with CD)


        N., Andrei,
Numerical Examples with SPENBAR - Modified penalty barrier method for
large-scale nonlinear programming problems. Part I.

ICI Technical Report, ICI-TR-01/2001, Bucharest, February 2001.


        N., Andrei,
An Interior Point Algorithm for Nonlinear Programming.
ICI Technical Report, August 3, 1998.


        N., Andrei,
Alternative Model Formulations in Nonlinear Programming.
ICI Technical Report, January 22, 1998.


        N., Andrei,
Predictor-Corrector Interior-Point Methods for Linear Constrained Optimization.
ICI Technical Report, September 23, 1997.


        N., Andrei,
MINOS Examples considered into the book: Advanced Mathematical Programming.
Theory, Computational Methods, Applications.

ICI Technical Report, March 25, 1997.


        N., Andrei,
NLPQL Examples considered into the book: Advanced Mathematical Programming.
Theory, Computational Methods, Applications.

ICI Technical Report, March 25, 1997.


        N., Andrei,
SPENBAR Examples considered into the book: Advanced Mathematical Programming.
Theory, Computational Methods, Applications.

ICI Technical Report, March 25, 1997.


        N., Andrei,
Alternative model formulations in nonlinear programming.
Some disastrous computational results with four codes: GRG2, CONOPT, MINOS/AUGMENTED and SPENBAR.

ICI Technical Paper, May 26, 1996.


        N., Andrei,
Numerical Examples with SPENBAR for Large-Scale Nonlinear, Equality and Inequality Constrained Optimization with Zero Columns in Jacobian Matrices.
ICI Technical Paper No. AMOL-96-5, March 29, 1996.


        N., Andrei,
Computational Experience with SPENBAR a Sparse Variant of a Modified Penalty-Barrier Method for Large-Scale Nonlinear, Equality and Inequality Constrained Optimization.
ICI Technical Paper No. AMOL-96-4, March 11, 1996, pp.1-69.


        N., Andrei,
Computational Experience with a Modified Penalty-Barrier Method for Large-Scale Nonlinear Constrained Optimization. (FORTRAN subroutines)
ICI Working Paper No. AMOL-96-1, February 6, 1996.


        N., Andrei,
SIMEQ - Package for solving linear algebraic systems AX=b by Gauss method of elimination with column pivoting to determine x (solution of the system) and AINV (the inverse of the matrix). ICI Working Paper No. 5, January 25, 1995
(Romanian Academy Library, with CD)


        N., Andrei, Ghe., Borcan
ALLO - Algebraic Language for Linear Optimization.
ICI Technical Report, LSSO 2-95, Bucharest, September 21, 1995, pp.1-44.


        N. Andrei
RF - Package for solving large-scale linear algebraic systems with Product Form of Inverse (PFI) and Bump and Spike Pressigned Pivot Procedure.
Technical Report No. 4, September 3, 1995.
(Romanian Academy Library)


        N., Andrei,
Computational Experience with Conjugate Gradient Algorithms for Large-Scale Unconstrained Optimization.
ICI Technical Report, Bucharest, July 21, 1995, pp.1-26.


        N., Andrei,
STRUCTURE - An interactive package for structural evaluation of the determinant and characteristic polynomial of a matrix in symbolic form using its digraph representation.
Forschungsberiicht Nr. 4/1991, Mess-, Steuer- und Regelungstechnik,
Universitaet -GH- Duisburg, pp.1-61.


        N., Andrei,
CYCLE - An interactive package for cycle determination in digraphs.
Forschungsbericht Nr. 10/1990, Mess-, Steuer- und Regelungstechnik,
Universitaet -GH- Duisburg, pp.1-31.


        N., Andrei,
XLP - Linear Programming Library. Documentation manual.
ICI Technical Report, LSSO-30A-86, Bucharest, 1986.


        N., Andrei,
XLP - Linear Programming Library. FORTRAN programs.
ICI Technical Report, LSSO-30B-86, Bucharest, 1986.


        N., Andrei,
XLP - Linear Programming Library. Numerical examples.
ICI Technical Report, LSSO-30C-86, Bucharest, 1986.


        N., Andrei,
Application of sparse matrix techniques in GRG algorithm for large-scale
nonlinear programming.

ICI Technical Report, LSSO-026, Bucharest, June 1984, pp. 1-19.


        N., Andrei,
Metode de siteza a regulatoarelor liniare utilizand tehnici de calcul
cu matrice rare pentru sisteme de mari dimensiuni.

ICI Technical Report, LSSO-022, Bucharest, March 1984, pp. 1-142.
(Paper placed in Library of Romanian Academy)


        N., Andrei,
Metode de optimizare a sistemelor automate de mari dimensiuni.
ICI Technical Report, LSSO-021, Bucharest, Noiembrie 1983, pp. 1-95.
(Romanian Academy Library)


        N., Andrei,
Tehnici de calcul cu matrice rare in teoria sistemelor.
ICI Technical Report, LSSO-020, Bucharest, October 1983, pp. 1-95.


        N., Andrei, C. Rasturnoiu
FORTRAN subroutines for solving sparse band, symmetric and positive definite
linear equation systems of very large-scale dimensions.

ICI Technical Report, LSSO-014, Bucharest, April 1983, pp. 1-8.


        N., Andrei,
Digraph exact disturbance rejection of sparse systems.
ICI Technical Report, RD-LSSO-011, Bucharest, March 1983, pp. 1-15.


        N., Andrei
RP - A package for efficient calculation of sparse Jacobian matrix for nonlinear systems of equations using finite differences.
ICI Technical Report, Bucharest, April 15, 1983, pp. 1-31.


        N., Andrei, C. Rasturnoiu
Basic FORTRAN subroutine for large-scale sparse linear programming problems.
ICI Technical Report, LSSO-016, Bucharest, April 1983, pp. 1-17.


        N., Andrei,
MINOPT - Optimization computing library.
ICI Technical Report, LSSO-009, Bucharest, November 1982, pp. 1-125.


        N., Andrei, C. Rasturnoiu
Sparse Matrix Computing library. User's manual.
ICI Technical Report, LSSO-008, Bucharest, May 1982.


        N., Andrei,
An algorithm for parameter estimation in nonlinear systems.
ICI Technical Report, RD-OG1-006, Bucharest, November 1981, pp. 1-40.


        N., Andrei,
Computer aided management of production processes by dynamic modeling.
ICI Technical Report, RD-OG1-005, Bucharest, October 1981, pp. 1-36.


        N., Andrei,
Management of Production Processes by Dynamic Modeling.
ICI Technical Report, RD-OG1-003, Bucharest, April 1981, pp. 1-234.
(Paper placed in Library of Romanian Academy)


        N., Andrei,
Nested decomposition scheme for optimal control of large-scale linear dynamic systems.
ICI Technical Report, RD-OG1-001, Bucharest, January 1981, pp. 1-23.


        N., Andrei, C. Rasturnoiu
O subrutina de calcul a minimului unei functii neliniare de o variablia, pe un interval dat.
ICI Technical Report, Research Department, Bucharest, Februarie 1980, pp. 1-15.


        N., Andrei,
A simple algorithm for computing zero of a nonlinear function of a variable in a given interval [a,b].
ICI Technical Report, Research Department, Bucharest, March 28, 1975, pp. 1-9.


        N., Andrei,
A simple algorithm for computing all zeros of a nonlinear function of a variable in a given interval [a,b].
ICI Technical Report, Research Department, Bucharest, April 16, 1975, pp. 1-21.


  November 11, 2020