book chapter Jan 01, 1984

Numerical experiments with partially separable optimization problems

View at Publisher Save 10.1007/bfb0099526
Topics

No keywords indexed for this article. Browse by subject →

References
19
[1]
D.P. Bertsekas. Projected Newton Methods for Optimization Problems with Simple Constraints. SIAM Journal of Control and Optimization 20(2):221–246, 1982. 10.1137/0320018
[2]
J. Cullum and R.K. Brayton. Some Remarks on the Symmetric Rank-One Update. Journal of Optimization Theory and Applications 29(4):493–519, 1979. 10.1007/bf00934450
[3]
J.E. Dennis and H.H.W. Mei. Two New Unconstrained Optimization Algorithms Which Use Function and Gradient Values. Journal of Optimization Theory and Applications 28(4):453–482, 1979. 10.1007/bf00932218
[4]
Conjugate-Gradient Methods for Large-Scale Nonlinear Optimization.

Philip E. Gill, Walter Murray

1979 10.21236/ada078713
[5]
Ph.E. Gill, W. Murray and M.H. Wright. Practical Optimization. Academic Press, London, 1981.
[6]
Partitioned variable metric updates for large structured optimization problems

A. Griewank, Ph. L. Toint

Numerische Mathematik 1982 10.1007/bf01399316
[7]
Local convergence analysis for partitioned quasi-Newton updates

A. Griewank, Ph. L. Toint

Numerische Mathematik 1982 10.1007/bf01407874
[8]
A. Griewank and Ph.L. Toint. On the Unconstrained Optimization of Partially Separable Functions. In M.J.D. Powell (editor), Nonlinear Optimization 1981. Academic Press, New-York, 1982.
[9]
A. Griewank and Ph.L. Toint. On the Existence of Convex Decompositions of Partially Separable Functions. Mathematical Programming to appear, 1983. 10.1007/bf02612711
[10]
W. Hock and K. Schittkowski. Test Examples for Nonlinear Programming Codes. Lectures Notes in Economics and Mathematical Systems 187, Springer Verlag, Berlin, 1981. 10.1007/978-3-642-48320-2
[11]
H.Y. Huang. Unified Approach to Quadratically Convergent Algorithms For Function Minimization. Journal of Optimization Theory and Applications 5(6):405–423, 1970. 10.1007/bf00927440
[12]
E. Marwil. Exploiting Sparsity in Newton-Like Methods. PhD thesis, Cornell University, Ithaca, New-York, 1978.
[13]
D.P. O’Leary. A Discrete Newton Algorithm For Minimizing A Function of Many Variables. Mathematical Programming 23:20–33, 1982. 10.1007/bf01583777
[14]
M.J.D. Powell and Ph.L. Toint. The Shanno-Toint Procedure for Updating Sparse Symmetric Matrices. I.M.A. Journal of Numerical Analysis 1:403–413, 1981. 10.1093/imanum/1.4.403
[15]
D. F. Shanno. On Variable Metric Methods for Sparse Hessians. Mathematics of Computation 34:499–514, 1980. 10.1090/s0025-5718-1980-0559198-2
[16]
D.F. Shanno and K.H. Phua. Matrix Conditionning and Nonlinear Optimization. Mathematical Programming 14, 1978. 10.1007/bf01588962
[17]
G.W. Stewart. A Modification of Davidon’s Minimization Method to Accept Difference Approximations of Derivatives. Journal of the ACM 14, 1967. 10.1145/321371.321377
[18]
Ph.L. Toint. On Sparse And Symmetric Matrix Updating Subject To A Linear Equation. Mathematics of Computation 31:954–961, 1977. 10.1090/s0025-5718-1977-0455338-4
[19]
Ph.L. Toint. On the Superlinear Convergence of an Algorithm for Solving a Sparse Minimization Problem. SIAM Journal on Numerical Analysis 16:1036–1045, 1979. 10.1137/0716076
Metrics
24
Citations
19
References
Details
Published
Jan 01, 1984
Pages
203-220
License
View
Cite This Article
A. Griewank, Ph. L. Toint (1984). Numerical experiments with partially separable optimization problems. Lecture Notes in Mathematics, 203-220. https://doi.org/10.1007/bfb0099526
Related

You May Also Like