Discontinuous piecewise linear optimization

Mathematical Programming, Series B

Volumn 80, Issue 3, 1998, Pages 315-380

  Conn, Andrew R ^a   Mongeau, Marcel ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITÉ PAUL SABATIER   (France)

Author keywords

Active set approach; Degeneracy; Discontinuous optimization; Exact penalty method; Non differentiable optimization; Piecewise linear programming; Projected gradient direction

Indexed keywords

EID: 0347760077     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01581171     Document Type: Article

References (68)

1. K. Anderson, An efficient Newton barrier method for minimizing a sum of Euclidean norms, SIAM Journal on Optimization 6 (1996) 74-95.
2. T. Bannert, A trust region algorithm for nonsmooth optimization, Mathematical Programming 67 (1994) 247-264.
3. ∞ sense, SIAM Journal on Numerical Analysis 15 (1978) 255-270.
4. 1 problems, ACM Transactions on Mathematical Software 6 (1980) 594-608.
5. 1 data fitting, in: J.P. Hennart, ed., Proceedings of the Third Mexican Workshop on Numerical Analysis (Springer, Berlin, 1981) 48-58.
6. ∞ sense?, SIAM Journal on Numerical Analysis 26 (1989) 693-726.
7. A. Ben-Tal and M.P. Bendsoe, A new method for optimal truss topology design, SIAM Journal on Optimization 3 (1993) 322-358.
8. H.P. Benson, A finite algorithm for concave minimization over a polyhedron, Naval Research Logistics Quarterly 32 (1985) 165-177.
9. p norm location problems, Mathematical Programming 38 (1987) 75-109.
10. P.H. Calamai and A.R. Conn, A stable algorithm for solving the multifacility location problem involving Euclidean distances, SIAM Journal on Scientific and Statistical Computing 1 (1980) 512-525.
11. C. Cheng and E. Kuh, Module placement based on resistive network optimization, IEEE Transactions on Computer-Aided Design of integrated Circuits and Systems 3 (1984) 218-225.
12. F.H. Clarke, Optimization and Nonsmooth Analysis (John Wiley, New York, 1983).
13. T.F. Coleman and A.R. Conn, Nonlinear programming via an exact penalty function: Asymptotic analysis, Mathematical Programming 24 (1982) 123-136.
14. T.F. Coleman and A.R. Conn, Nonlinear programming via an exact penalty function: Global analysis, Mathematical Programming 24 (1982) 137-161.
15. T.F. Coleman and L.A. Hulbert, A globally and superlinearly convergent algorithm for convex quadratic programs with simple bounds, SIAM Journal on Optimization 3 (1993) 298-321.
16. 1 problems, in: D. Griffiths and G. Watson, eds., Proceedings of the 13th Biennial Numerical Analysis Conference Dundee 1989 (Longmans, 1990).
17. ∞ problems, SIAM Journal on Numerical Analysis 29 (1992) 1166-1186.
18. 1 problems, Mathematical Programming 56 (1992) 189-222.
19. A.R. Conn, Constrained optimization using a nondifferentiable penalty function, SIAM Journal on Numerical Analysis 10 (1973) 760-784.
20. A.R. Conn, Projection matrices - A fundamental concept in optimization, in: Vogt and Mickle, eds., Proceedings of the 7th Annual Conference in Modelling and Simulation (1976) 599-605.
21. A.R. Conn, Nonlinear programming, exact penalty functions and projection techniques for non-smooth functions, in: P.T. Boggs, R.H. Byrd and R.B. Schnabel, eds., Numerical Optimization 1984 - Proceedings of the SIAM Conference on Numerical Optimization, Boulder (1985) 3-25.
22. A.R. Conn and G. Cornuéjols, A projection method for the uncapacitated facility location problem, Mathematical Programming 46 (1990) 273-298.
23. A.R. Conn and Y. Li, A structure exploiting algorithm for nonlinear minimax problems, SIAM Journal on Optimization 1 (1992) 242-263.
24. A.R. Conn and M.L. Overton, A primal-dual interior point method for minimizing a sum of Euclidean distance, Research Report, 1994. Unpublished.
25. A.R. Conn and T. Pietrzykowski, A penalty function method converging directly to a constrained optimum, SIAM Journal on Numerical Analysis 14 (1977) 348-375.
26. D. De Wolf, O.J. de Bisthoven and Y. Smeers, The simplex method extended to piecewise-linearly constrained problems I: The method and an implementation, Technical Report, Center for Operations Research and Econometrics, Louvain-La-Neuve, Belgium, 1991.
27. D. De Wolf, O.J. de Bisthoven and Y. Smeers, The simplex method extended to piecewise-linearly constrained problems II: An application to the gas transmission problem, Technical Report, Center for Operations Research and Econometrics, Louvain-La-Neuve, Belgium, 1991.
28. G. Di Pillo and L. Grippo, Exact penalty functions in constrained optimization, SIAM Journal on Control and Optimization 21 (1989) 1333-1360.
29. S.S. Erenguc and H.P. Benson, The interactive fixed charge linear programming problem, Naval Research Logistics Quarterly 33 (1986) 157-177.
30. A.V. Fiacco and G.P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques (John Wiley, New York, 1968); reprint: (SIAM, Philadelphia, PA, 1990).
31. R. Fletcher, A model algorithm for composite nondifferentiable optimization problems, Mathematical Programming Study 17 (1982) 67-76.
32. R. Fletcher, Practical Methods of Optimization (Wiley/Interscience, New York, 2nd ed., 1987).
33. R. Fourer, A simplex algorithm for piecewise-linear programming I: Derivation and proof. Mathematical Programming 33 (1985) 204-233.
34. R. Fourer, A simplex algorithm for piecewise-linear programming II: Finiteness, feasibility and degeneracy, Mathematical Programming 41 (1988) 281-315.
35. R. Fourer, A simplex algorithm for piecewise-linear programming III: Computational analysis and applications, Mathematical Programming 53 (1992) 213-235.
36. A.B. Gamble, A.R. Conn and W.R. Pulleyblank, A network penalty method, Mathematical Programming 50 (1991) 53-73.
37. J. Gauvin, P. Parent and G, Savard, Répartition optimale de la puissance dans une centrale hydraulique à réserve pompée, RAIRO Recherche Opérationnelle/Operations Research 20 (1986) 1-18.
38. M. Gendreau and M. Mongeau, General interactive fixed-charge piecewise-linear programming using tabu search, Technical Report, Centre de recherche sur les transports, Université de Montréal. In preparation.
39. P.E. Gill, W. Murray and M.H. Wright, Practical optimization (Academic Press, New York, 1981).
40. J. Hald and K. Madsen, Combined LP and Quasi-Newton methods for minimax optimization, Mathematical Programming 20 (1981) 49-62.
41. S.P. Han, Variable metric methods for minimizing a class of nondifferentiable functions, Mathematical Programming 20 (1981) 1-13.
42. S. Hiraki, A simplex procedure for a fixed charge problem. Journal of the Operations Research Society of Japan 23 (1980) 243-266.
43. I.I. Imo and D.J. Leech, Discontinuous optimization in batch production using SUMT, International Journal of Production Research 22 (1984) 313-321.
44. E.M. Klein and S.H. Sim. Discharge allocation for hydro-electric generating stations, European Journal of Ope rational Research 13 (1994) 132-138.
45. D.E. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching (Addison-Wesley, Reading, MA, 1975).
46. C. Lemaréchal, Bundle methods in nonsmooth optimization, in: C. Lemaréchal and R. Mifflin, eds., Proceedings of the IIASA Workshop, Nonsmooth Optimization, 1977 (Pergamon Press, Oxford, 1978) 79-102.
47. D.M. Mates, A projection method for the floor planning problem, Ph.D. Thesis, Dept. of Combinatorics and Optimization, University of Waterloo, Ontario, Canada, 1993.
48. M. Mongeau, Discontinuous piecewise linear optimization, Ph.D. Thesis, Dept. of Combinatorics and Optimization, University of Waterloo, Ontario, Canada, 1991.
49. B. Montreuil, H.D. Ratliff and M. Goetschalckx, Matching based interactive facility layout, AIIE Transactions 19 (1987) 271-279.
50. 1 optimization, SIAM Journal on Scientific and Statistical Computing 2 (1981) 207-224.
51. M.R. Osborne, Finite Algorithms in Optimization and Data Analysis (John Wiley, New York, 1985).
52. M.R. Osborne, S. Pruess and R.S. Womersley, Concise representation of generalised gradients, Journal of the Australian Mathematical Society 28 (1986) 57-74.
53. M.R. Osborne and G.A. Watson, An algorithm for minimax approximation in the nonlinear case, Computing Journal 12 (1968) 63-68.
54. M.L. Overton and R.S. Womersley, On minimizing the spectral radius of a nonsymmetric matrix function: Optimality conditions and duality theory, SIAM Journal on Matrix Analysis and Applications 9 (1988) 473-498.
55. M.L. Overton and R.S. Womersley, On the sum of the largest eigenvalues of a symmetric matrix, SIAM Journal on Matrix Analysis and Applications 13 (1992) 41-45.
56. M.L. Overton and R.S. Womersley, Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices, Mathematical Programming 62 (1993) 321-357.
57. U.S. Palekar, M.H. Karwan and S. Zionts, A branch-and-bound method for the fixed charge transportation problem, Management Science 36 (1990) 1092-1105.
58. D.M. Ryan and M.R. Osborne, On the solution of highly degenerate linear programmes, Mathematical Programming 41 (1988) 385-392.
59. A. Tishler and I. Zang, A switching regression method using inequality conditions, Journal of Econometrics 11 (1979) 259-274.
60. G. Vijayan and R.-S. Tsay, A new method for floorplanning using topological constraint reduction, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 10 (1991).
61. P. Wolfe, A technique for resolving degeneracy in linear programming, SIAM Journal 11 (1963) 205-211.
62. R.S. Womersley, Optimality conditions for piecewise smooth functions, Mathematical Programming Study 17 (1982) 13-27.
63. R.S. Womersley, Local properties of algorithms for minimizing nonsmooth composite functions, Mathematical Programming 32 (1985) 69-89.
64. 1 approximation, SIAM Journal on Scientific and Statistical Computing 7 (1986) 105-122.
65. R.S. Womersley and R. Fletcher, An algorithm for composite nonsmooth optimization problems, Journal of Optimization Theory and Applications 48 (1986) 493-523.
66. I. Zang, Discontinuous optimization by smoothing, Mathematics of Operations Research 6 (1981) 140-152.
67. W.I. Zangwill, An algorithm for the Chebyshev problem - With an application to concave programming, Management Science 14 (1967) 58-78.
68. J. Zowe, Nondifferentiable optimization, in: K. Schittkowski, ed., Computational Mathematical Programming, Bad Windsheim, 1984, NATO Advanced Science Institute Series F, Vol. 15 (Springer, Berlin, 1985) 323-356.