Two approaches to nonlinear decomposition

References

• Eaves , B.C. and Zangwill , W.I. 1971 . Generalized cutting plane algorithms . SIAM Journal on Control , 9 : 529 – 542 .
   Web of Science ®Google Scholar
• Fiacco , A.V. and FcCormick , G.P. 1968 . Nonlinear programming:Sequential unconstrained minimization techniques , New York : John Wiley and Sons .
   Google Scholar
• Fletcher , R. 1970 . A new approach to variable metric algorithms . Computer Journal , 13 : 317 – 322 .
   Web of Science ®Google Scholar
• Geoffrion , A.M. 1972 . Generalized Benders Decomposition . Journal of Optimization Theory and Applications , 10 : 237 – 260 .
   Google Scholar
• Goldstein , A.A. and Price , J.F. 1967 . An effective algorithm for minimization . Nurnerische Mathematik , 10 : 184 – 189 .
   Google Scholar
•  Google Scholar
• Held , M. and Karp , R.M. 1971 . The travelling-salesman problem and minimum spanning trees; part II . Mathematical Programming , 1 : 6 – 25 .
   Google Scholar
• Held , M. , Wolfe , P. and Csowdee , H.P. 1974 . Validation of subgradient optimization . Mathematical Programming , 6 : 62 – 88 .
   Google Scholar
• Hogan , W.W. 1973 . Applications of a general convergence theory for outer approximation algorithms . Mathematical Programming , 5 : 151 – 168 .
   Google Scholar
• Kjronsjö , T.O.M. 1967 . “ Centralization and Decentralization of Decision Making ” . In Decomposition of an Economic System Consisting of a Convex and Nonconvex Section , Vol. 9 , University of Birmingham . Discussion Papers, RC/A
   Google Scholar
• Kronsjö , T.O.M. 1969 . Decomposition of a large nonlinear convex separable economic system in the dual direction . Economics of Planning , 9 : 71 – 94 .
   Google Scholar
• Lemabechal , C. 1975 . An extension of David on methods to non-differentiate problems . Mathematical Programming Study , 3 : 95 – 109 .
   Google Scholar
•  Google Scholar
•  Google Scholar
•  Google Scholar
• Powell , M.J.D. 1970 . “ Rank one methods for unconstrained optimization ” . In Integer and nonlinear programming , Edited by: Abadie , J. 139 – 156 . Amsterdam : North-Holland .
   Google Scholar
• Powell , M.J.D. 1971 . Recent advances in unconstrained optimization . Mathematical Programming , 1 : 26 – 57 .
   Google Scholar
• Rocbiafellar , R.T. 1970 . Convex Analysis , Princeton : Princeton University Press .
   Google Scholar
• Sandblom , C.L. 1972 . Nonlinear Programming:Unconstrained and Constrained Minimization Techniques , Great Britain : University of Birmingham . National Economic Planning Research Paper No. 59
   Google Scholar
• Himmelblau , D.M. , ed. 1973 . “ A Computational Investigation into Nonlinear Decomposition ” . In Decomposition of Large-Scale Problems , 415 – 426 . Amsterdam : North-Holland .
   Google Scholar
• Sandblom , C.L. 1974 . Strategics for Nonlinear Decomposition National Economic Planning Research Paper No. 85
   Google Scholar
• Sandblom , C.L. 1978 . Theorems on thfs Decomposition of a Large Nonlinear Convex Separable Economic System in the Dual Direction . Economics of Planning , 14 : 45 – 53 .
   Google Scholar
• Slater , M. 1950 . Lagbamge Multipliers Kevisited:A Contribution to Nonlinear Programming . Mathematics , 403
   Google Scholar
• Wolfe , P. 1961 . A "Duality Theorem for Nonlinear Programming . Quarterly of Applied Mathematics , 19 : 239 – 244 .
   Google Scholar
• Wolfe , P. 1989 . Convergence conditions tor ascent methods . SIAM Review , 11 : 226 – 235 .
   Google Scholar
• Wolfe , P. 1970 . “ Convergence theory in nonlinear programming ” . In Integer and nonlinear programming , Edited by: Abadie , J. 1 – 36 . Amsterdam : North-Holland .
   Google Scholar
• Wolfe , P. 1975 . A method of conjugate subgradients for minimizing nondifferentiabie functions . Mathematical Programming Study , 3 : 145 – 173 .
   Google Scholar