article

Free access

Testing Unconstrained Optimization Software

Editor: John R. Rice Authors:

Jorge J. Moré,

Burton S. Garbow,

Kenneth E. HillstromAuthors Info & Claims

ACM Transactions on Mathematical Software (TOMS), Volume 7, Issue 1

Pages 17 - 41

https://doi.org/10.1145/355934.355936

Published: 01 March 1981 Publication History

PDF eReader

References

[1]

BARD, Y. Comparison of gradient methods for the solution of nonlinear parameter estnnation problems SIAM J. Numer. Anal. 7 (1970), 157-186.

Google Scholar

[2]

BEALE, E.M.L. On an iterative method of finding a local mmnnum of a function of more than one variable. Tech. Rep. No. 25, Statistical Techniques Research Group, Princeton Umv., Princeton, N.J., 1958.

Google Scholar

[3]

BIGGS, M.C. Minimization algorithms making use of non-quadratic properties of the obJective function. J Inst. Math Appl 8 (1971), 315-327.

Google Scholar

[4]

Box, M.J. A comparison of several current optimization methods, and the use of transformations in constrained problems. Comput. J 9 (1966), 67-77.

Google Scholar

[5]

BRowN, K.M. A quadratically convergent Newton-hke method based upon Gausslan elmunation. SIAM J. Numer. Anal. 6 (1969), 560-569.

Google Scholar

[6]

BROWN, K.M., ASD DENNIS, J.E. New computational algorithms for minimizing a sum of squares of nonhnear functions. Rep. No. 71-6, Yale Univ, Dep. Comput. Science, New Haven, Conn., March 1971.

Google Scholar

[7]

BROYDEN, C.G. A class of methods for solving nonlinear simultaneous equations. Math Comput 19 (1965), 577-593.

Google Scholar

[8]

BROYDEN, C.G. The convergence of an algorithm for solving sparse nonlinear systems. Math. Comput. 25 (1971), 285-294.

Google Scholar

[9]

COLVILLE, A.R. A comparative study of nonlinear programming codes. Rep. 320-2949, IBM New York Scientific Center, 1968.

Google Scholar

[10]

Cox, R A. Comparison of the performance of seven optimization algorithms on twelve unconstrained optimization problems. Ref. 1335CNO4, Gulf Research and Development Company, Pittsburg, Jan. 1969.

Google Scholar

[11]

FLETCHER, R. Function minimization without evaluating derlvatlves--A review. Comput. J. 8 (1965), 33-41.

Google Scholar

[12]

FLETCHER, R., AND POWELL, M.J.D. A rapidly convergent descent method for minn-nizatlon Comput. J. 6 (1963), 163-168.

Google Scholar

[13]

FREUDENSTEIN, F., AND ROTH, B. Numerical solutions of systems of nonlinear equations. J ACM 10, 4 (Oct. 1963), 550-556.

Crossref

Google Scholar

[14]

GILL, P E, MURRAY W, AND PITFIELD, R.A. The nnplementation of two revised quas~-Newton algorithms for unconstrained optnmzatlon. Rep. NAC 11, National Phys. Lab., April 1972, pp. 82- 83.

Google Scholar

[15]

HILLSTROM, K.E. A snnulaUon test approach to the evaluation of nonhnear opt~rmzatlon algorithms. A CM Trans. Math. Softw. 3, 4 (1977), 305-315.

Crossref

Google Scholar

[16]

JENNRICH, R.I., AND SAMPSON, P.F. Application of stepwise regression to nonlinear estimation. Technometrtcs 10 (1968), 63-72.

Google Scholar

[17]

KOWALIK, J S, AND OSBORNE, M.R Methods for Unconstramed Optimtzatton Problems. Elsevier North-Holland, New York, 1968

Google Scholar

[18]

MEYER, R.R. Theoretical and computational aspects of nonlinear regression. In Nonlinear Programmmg, J. B. Rosen, O. L. Mangasanan, and K. Rltter (Eds), Academic Press, New York, 1970, pp. 465-486.

Google Scholar

[19]

MOR~, J J. The Levenberg-Marquardt algorithm. Implementation and theory In Numertcal Analysts, G. A. Watson (Ed.), Lecture Notes tn Mathemattcs 630, Sprmger-Verlag, New York, 1977, pp. 105-116.

Google Scholar

[20]

MOR}~, J.J., AND COSNARD, M.Y. Numerical solution of nonlinear equations. ACM Trans. Math. Softw 5, 1 (March 1979), 64-85.

Crossref

Google Scholar

[21]

OSBORNE, M.R. Some aspects of nonlinear least squares calculations. In Numerical Methods for Nonhnear Optimization, F. A. Lootsma (Ed), Academic Press, New York, 1972, pp 171-189.

Google Scholar

[22]

POWELL, M.J.D. A hybrid method for nonlinear equations. In Numer~calMethods for Nonlinear Algebraic Equations, P. Rabinowitz (Ed), Gordon & Breach, New York, 1970, pp. 87-114

Google Scholar

[23]

POWELL, M.J.D. An iterative method for finding stationary values of a function of several variables. Comput. J. 5 (1962), 147-151.

Google Scholar

[24]

ROSENBROCK, H.H. An automatic method for finding the greatest or least value of a function. Comput. J. 3 (1960), 175-184.

Google Scholar

[25]

SPEDICATO, E. Computational experience with quasi-Newton algorithms for minimization problems of moderately large size Rep. CISE-N-175, Segrate (Milano), 1975.

Google Scholar

Cited By

View all

Jian JJin JMa G(2025)An IDFPM-based algorithm without Lipschitz continuity to constrained nonlinear equations for sparse signal and blurred image restoration problemsJournal of Computational and Applied Mathematics10.1016/j.cam.2024.116234456(116234)Online publication date: Mar-2025
https://doi.org/10.1016/j.cam.2024.116234
Ishak MMarjugi S(2024)A New Hybrid Three-Term LS-CD Conjugate Gradient In Solving Unconstrained Optimization ProblemsMalaysian Journal of Mathematical Sciences10.47836/mjms.18.1.1018:1(167-184)Online publication date: 27-Mar-2024
https://doi.org/10.47836/mjms.18.1.10
Lv YXing LBao WLi WGuo Z(2024)A class of pseudoinverse-free greedy block nonlinear Kaczmarz methods for nonlinear systems of equationsNetworks and Heterogeneous Media10.3934/nhm.202401419:1(305-323)Online publication date: 2024
https://doi.org/10.3934/nhm.2024014
Show More Cited By

Index Terms

Testing Unconstrained Optimization Software
1. Mathematics of computing
  1. Mathematical analysis
    1. Mathematical optimization
  2. Mathematical software
2. Theory of computation
  1. Design and analysis of algorithms
    1. Mathematical optimization

Recommendations

Two-layer particle swarm optimization for unconstrained optimization problems

In this article, a two-layer particle swarm optimization (TLPSO) is proposed to increase the diversity of the particles so that the drawback of trapping in a local optimum is avoided. In order to design the TLPSO, a structure with two layers (top layer ...
Hybrid Artificial Immune Algorithm and Particle Swarm Optimization for Solving Unconstrained Global Optimization Problems
IS3C '12: Proceedings of the 2012 International Symposium on Computer, Consumer and Control

This work presents a meta-heuristic approach that integrates an artificial immune algorithm and a particle swarm optimization (AIA-PSO) method to solve unconstrained global optimization (UGO) problems. Using an external AIA, the parameter settings of an ...
An improved quantum-behaved particle swarm optimization algorithm with elitist breeding for unconstrained optimization

An improved quantum-behaved particle swarm optimization with elitist breeding (EB-QPSO) for unconstrained optimization is presented and empirically studied in this paper. In EB-QPSO, the novel elitist breeding strategy acts on the elitists of the swarm ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Mathematical Software

ACM Transactions on Mathematical Software Volume 7, Issue 1

March 1981

146 pages

ISSN:0098-3500

EISSN:1557-7295

DOI:10.1145/355934

Editor:
John R. Rice
Purdue Univ., West Lafayette, IN

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1981

Published in TOMS Volume 7, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1,147
Total Citations
View Citations
6,171
Total Downloads

Downloads (Last 12 months)925
Downloads (Last 6 weeks)88

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jian JJin JMa G(2025)An IDFPM-based algorithm without Lipschitz continuity to constrained nonlinear equations for sparse signal and blurred image restoration problemsJournal of Computational and Applied Mathematics10.1016/j.cam.2024.116234456(116234)Online publication date: Mar-2025
https://doi.org/10.1016/j.cam.2024.116234
Ishak MMarjugi S(2024)A New Hybrid Three-Term LS-CD Conjugate Gradient In Solving Unconstrained Optimization ProblemsMalaysian Journal of Mathematical Sciences10.47836/mjms.18.1.1018:1(167-184)Online publication date: 27-Mar-2024
https://doi.org/10.47836/mjms.18.1.10
Lv YXing LBao WLi WGuo Z(2024)A class of pseudoinverse-free greedy block nonlinear Kaczmarz methods for nonlinear systems of equationsNetworks and Heterogeneous Media10.3934/nhm.202401419:1(305-323)Online publication date: 2024
https://doi.org/10.3934/nhm.2024014
Cheng YGao J(2024)An efficient augmented memoryless quasi-Newton method for solving large-scale unconstrained optimization problemsAIMS Mathematics10.3934/math.202412319:9(25232-25252)Online publication date: 2024
https://doi.org/10.3934/math.20241231
Zhu DYang YCao M(2024)An accelerated adaptive two-step Levenberg–Marquardt method with the modified Metropolis criterionAIMS Mathematics10.3934/math.202411999:9(24610-24635)Online publication date: 2024
https://doi.org/10.3934/math.20241199
Han YRui S(2024)A New Adaptive Levenberg–Marquardt Method for Nonlinear Equations and Its Convergence Rate under the Hölderian Local Error Bound ConditionSymmetry10.3390/sym1606067416:6(674)Online publication date: 30-May-2024
https://doi.org/10.3390/sym16060674
Moghrabi IHassan B(2024)An Efficient Limited Memory Multi-Step Quasi-Newton MethodMathematics10.3390/math1205076812:5(768)Online publication date: 4-Mar-2024
https://doi.org/10.3390/math12050768
Silva BLopes LMendonça F(2024)Parallel GPU-Acceleration of Metaphorless Optimization Algorithms: Application for Solving Large-Scale Nonlinear Equation SystemsApplied Sciences10.3390/app1412534914:12(5349)Online publication date: 20-Jun-2024
https://doi.org/10.3390/app14125349
Yunus RZainuddin NDaud HKannan RMuhammad Yahaya MAriffin Abdul Karim S(2024)New CG-Based Algorithms With Second-Order Curvature Information for NLS Problems and a 4DOF Arm Robot ModelIEEE Access10.1109/ACCESS.2024.339355512(61086-61103)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3393555
Zhang BHe QChen CLi SLi M(2024)The Dai–Liao-type conjugate gradient methods for solving vector optimization problemsOptimization Methods and Software10.1080/10556788.2024.2380697(1-35)Online publication date: 23-Jul-2024
https://doi.org/10.1080/10556788.2024.2380697
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Two-layer particle swarm optimization for unconstrained optimization problems

Hybrid Artificial Immune Algorithm and Particle Swarm Optimization for Solving Unconstrained Global Optimization Problems

An improved quantum-behaved particle swarm optimization algorithm with elitist breeding for unconstrained optimization

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations