{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T06:08:33Z","timestamp":1767852513000,"version":"3.49.0"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1007\/bf01581171","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:38:16Z","timestamp":1114681096000},"page":"315-380","source":"Crossref","is-referenced-by-count":18,"title":["Discontinuous piecewise linear optimization"],"prefix":"10.1007","volume":"80","author":[{"given":"Andrew R.","family":"Conn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Mongeau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1137\/0806006","volume":"6","author":"K. Anderson","year":"1996","unstructured":"K. Anderson, An efficient Newton barrier method for minimizing a sum of Euclidean norms,SIAM Journal on Optimization 6 (1996) 74\u201395.","journal-title":"SIAM Journal on Optimization"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01582223","volume":"67","author":"T. Bannert","year":"1994","unstructured":"T. Bannert, A trust region algorithm for nonsmooth optimization,Mathematical Programming 67 (1994) 247\u2013264.","journal-title":"Mathematical Programming"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1137\/0715017","volume":"15","author":"R. Bartels","year":"1978","unstructured":"R. Bartels, C. Charalambous and A.R. Conn, On cline's direct method for solving overdetermined linear systems in thel \u221e sense,SIAM Journal on Numerical Analysis 15 (1978) 255\u2013270.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/355921.355930","volume":"6","author":"R.H. Bartels","year":"1980","unstructured":"R.H. Bartels and A.R. Conn, Linearly constrained discretel 1 problems,ACM Transactions on Mathematical Software 6 (1980) 594\u2013608.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"CR5","first-page":"48","volume-title":"Proceedings of the Third Mexican Workshop on Numerical Analysis","author":"R.H. Bartels","year":"1981","unstructured":"R.H. Bartels and A.R. Conn, An approach to nonlinearl 1 data fitting, in: J.P. Hennart, ed.,Proceedings of the Third Mexican Workshop on Numerical Analysis (Springer, Berlin, 1981) 48\u201358."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1137\/0726041","volume":"26","author":"R.H. Bartels","year":"1989","unstructured":"R.H. Bartels, A.R. Conn and Y. Li, Primal methods are better than dual methods for solving overdetermined linear systems in thel \u221e sense?,SIAM Journal on Numerical Analysis 26 (1989) 693\u2013726.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1137\/0803015","volume":"3","author":"A. Ben-Tal","year":"1993","unstructured":"A. Ben-Tal and M.P. Bendsoe, A new method for optimal truss topology design,SIAM Journal on Optimization 3 (1993) 322\u2013358.","journal-title":"SIAM Journal on Optimization"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/nav.3800320119","volume":"32","author":"H.P. Benson","year":"1985","unstructured":"H.P. Benson, A finite algorithm for concave minimization over a polyhedron,Naval Research Logistics Quarterly 32 (1985) 165\u2013177.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02591853","volume":"38","author":"P.H. Calamai","year":"1987","unstructured":"P.H. Calamai and A. Conn, A projected Newton method forl p norm location problems,Mathematical Programming 38 (1987) 75\u2013109.","journal-title":"Mathematical Programming"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1137\/0901037","volume":"1","author":"P.H. Calamai","year":"1980","unstructured":"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\u2013525.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/TCAD.1984.1270078","volume":"3","author":"C. Cheng","year":"1984","unstructured":"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\u2013225.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"CR12","volume-title":"Optimization and Nonsmooth Analysis","author":"F.H. Clarke","year":"1983","unstructured":"F.H. Clarke,Optimization and Nonsmooth Analysis (John Wiley, New York, 1983)."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01585100","volume":"24","author":"T.F. Coleman","year":"1982","unstructured":"T.F. Coleman and A.R. Conn, Nonlinear programming via an exact penalty function: Asymptotic analysis,Mathematical Programming 24 (1982) 123\u2013136.","journal-title":"Mathematical Programming"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01585101","volume":"24","author":"T.F. Coleman","year":"1982","unstructured":"T.F. Coleman and A.R. Conn, Nonlinear programming via an exact penalty function: Global analysis,Mathematical Programming 24 (1982) 137\u2013161.","journal-title":"Mathematical Programming"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0803014","volume":"3","author":"T.F. Coleman","year":"1993","unstructured":"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\u2013321.","journal-title":"SIAM Journal on Optimization"},{"key":"CR16","unstructured":"T.F. Coleman and Y. Li, A global and quadratic affine scaling method for (augmented) linearl 1 problems, in: D. Griffiths and G. Watson, eds.,Proceedings of the 13th Biennial Numerical Analysis Conference Dundee 1989 (Longmans, 1990)."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"1166","DOI":"10.1137\/0729071","volume":"29","author":"T.F. Coleman","year":"1992","unstructured":"T.F. Coleman and Y. Li, A global and quadratically convergent method for linearl \u221e problems,SIAM Journal on Numerical Analysis 29 (1992) 1166\u20131186.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF01580899","volume":"56","author":"T.F. Coleman","year":"1992","unstructured":"T.F. Coleman and Y. Li, A globally and quadratically convergent affine scaling method for linearl 1 problems,Mathematical Programming 56 (1992) 189\u2013222.","journal-title":"Mathematical Programming"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1137\/0710063","volume":"10","author":"A.R. Conn","year":"1973","unstructured":"A.R. Conn, Constrained optimization using a nondifferentiable penalty function,SIAM Journal on Numerical Analysis 10 (1973) 760\u2013784.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR20","unstructured":"A.R. Conn, Projection matrices \u2014 A fundamental concept in optimization, in: Vogt and Mickle, eds.,Proceedings of the 7th Annual Conference in Modelling and Simulation (1976) 599\u2013605."},{"key":"CR21","unstructured":"A.R. Conn, Nonlinear programming, exact penalty functions and projection techniques for nonsmooth functions, in: P.T. Boggs, R.H. Byrd and R.B. Schnabel, eds.,Numerical Optimization 1984 \u2014 Proceedings of the SIAM Conference on Numerical Optimization, Boulder (1985) 3\u201325."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF01585746","volume":"46","author":"A.R. Conn","year":"1990","unstructured":"A.R. Conn and G. Cornu\u00e9jols, A projection method for the uncapacitated facility location problem,Mathematical Programming 46 (1990) 273\u2013298.","journal-title":"Mathematical Programming"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1137\/0802013","volume":"2","author":"A.R. Conn","year":"1992","unstructured":"A.R. Conn and Y. Li, A structure exploiting algorithm for nonlinear minimax problems,SIAM Journal on Optimization 2 (1992) 242\u2013263.","journal-title":"SIAM Journal on Optimization"},{"key":"CR24","unstructured":"A.R. Conn and M.L. Overton, A primal-dual interior point method for minimizing a sum of Euclidean distance, Research Report, 1994. Unpublished."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0714022","volume":"14","author":"A.R. Conn","year":"1977","unstructured":"A.R. Conn and T. Pietrzykowski, A penalty function method converging directly to a constrained optimum,SIAM Journal on Numerical Analysis 14 (1977) 348\u2013375.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR26","volume-title":"The simplex method extended to piecewise-linearly constrained problems I: The method and an implementation, Technical Report","author":"D. Wolf De","year":"1991","unstructured":"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."},{"key":"CR27","volume-title":"The simplex method extended to piecewise-linearly constrained problems II: An application to the gas transmission problem, Technical Report","author":"D. Wolf De","year":"1991","unstructured":"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."},{"key":"CR28","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1137\/0327068","volume":"27","author":"G. Pillo Di","year":"1989","unstructured":"G. Di Pillo and L. Grippo, Exact penalty functions in constrained optimization,SIAM Journal on Control and Optimization 27 (1989) 1333\u20131360.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/nav.3800330202","volume":"33","author":"S.S. Erenguc","year":"1986","unstructured":"S.S. Erenguc and H.P. Benson, The interactive fixed charge linear programming problem,Naval Research Logistics Quarterly 33 (1986) 157\u2013177.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR30","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"A.V. Fiacco","year":"1968","unstructured":"A.V. Fiacco and G.P. McCormick,Nonlinear Programming: Sequential Unconstrained Minimization Techniques (John Wiley, New York, 1968); reprint: (SIAM, Philadelphia, PA, 1990)."},{"key":"CR31","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BFb0120959","volume":"17","author":"R. Fletcher","year":"1982","unstructured":"R. Fletcher, A model algorithm for composite nondifferentiable optimization problems,Mathematical Programming Study 17 (1982) 67\u201376.","journal-title":"Mathematical Programming Study"},{"key":"CR32","volume-title":"Practical Methods of Optimization","author":"R. Fletcher","year":"1987","unstructured":"R. Fletcher,Practical Methods of Optimization (Wiley\/Interscience, New York, 2nd ed., 1987).","edition":"2nd ed."},{"key":"CR33","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/BF01582246","volume":"33","author":"R. Fourer","year":"1985","unstructured":"R. Fourer, A simplex algorithm for piecewise-linear programming I: Derivation and proof,Mathematical Programming 33 (1985) 204\u2013233.","journal-title":"Mathematical Programming"},{"key":"CR34","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF01580769","volume":"41","author":"R. Fourer","year":"1988","unstructured":"R. Fourer, A simplex algorithm for piecewise-linear programming II: Finiteness, feasibility and degeneracy,Mathematical Programming 41 (1988) 281\u2013315.","journal-title":"Mathematical Programming"},{"key":"CR35","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01585703","volume":"53","author":"R. Fourer","year":"1992","unstructured":"R. Fourer, A simplex algorithm for piecewise-linear programming III: Computational analysis and applications,Mathematical Programming 53 (1992) 213\u2013235.","journal-title":"Mathematical Programming"},{"key":"CR36","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01594924","volume":"50","author":"A.B. Gamble","year":"1991","unstructured":"A.B. Gamble, A.R. Conn and W.R. Pulleyblank, A network penalty method,Mathematical Programming 50 (1991) 53\u201373.","journal-title":"Mathematical Programming"},{"key":"CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro\/1986200100011","volume":"20","author":"J. Gauvin","year":"1986","unstructured":"J. Gauvin, P. Parent and G. Savard, R\u00e9partition optimale de la puissance dans une centrale hydraulique \u00e0 r\u00e9serve pomp\u00e9e,RAIRO Recherche Op\u00e9rationnelle\/Operations Research 20 (1986) 1\u201318.","journal-title":"RAIRO Recherche Op\u00e9rationnelle\/Operations Research"},{"key":"CR38","unstructured":"M. Gendreau and M. Mongeau, General interactive fixed-charge piecewise-linear programming using tabu search, Technical Report, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al. In preparation."},{"key":"CR39","volume-title":"Practical optimization","author":"P.E. Gill","year":"1981","unstructured":"P.E. Gill, W. Murray and M.H. Wright,Practical optimization (Academic Press, New York, 1981)."},{"key":"CR40","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01589332","volume":"20","author":"J. Hald","year":"1981","unstructured":"J. Hald and K. Madsen, Combined LP and Quasi-Newton methods for minimax optimization,Mathematical Programming 20 (1981) 49\u201362.","journal-title":"Mathematical Programming"},{"key":"CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01589328","volume":"20","author":"S.P. Han","year":"1981","unstructured":"S.P. Han, Variable metric methods for minimizing a class of nondifferentiable functions,Mathematical Programming 20 (1981) 1\u201313.","journal-title":"Mathematical Programming"},{"key":"CR42","doi-asserted-by":"crossref","first-page":"243","DOI":"10.15807\/jorsj.23.243","volume":"23","author":"S. Hiraki","year":"1980","unstructured":"S. Hiraki, A simplex procedure for a fixed charge problem,Journal of the Operations Research Society of Japan 23 (1980) 243\u2013266.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"CR43","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1080\/00207548408942456","volume":"22","author":"I.I. Imo","year":"1984","unstructured":"I.I. Imo and D.J. Leech, Discontinuous optimization in batch production using SUMT,International Journal of Production Research 22 (1984) 313\u2013321.","journal-title":"International Journal of Production Research"},{"key":"CR44","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0377-2217(94)90151-1","volume":"73","author":"E.M. Klein","year":"1994","unstructured":"E.M. Klein and S.H. Sim. Discharge allocation for hydro-electric generating stations,European Journal of Operational Research 73 (1994) 132\u2013138.","journal-title":"European Journal of Operational Research"},{"key":"CR45","volume-title":"The Art of Computer Programming, Vol. 3, Sorting and Searching","author":"D.E. Knuth","year":"1975","unstructured":"D.E. Knuth,The Art of Computer Programming, Vol. 3, Sorting and Searching (Addison-Wesley, Reading, MA, 1975)."},{"key":"CR46","first-page":"79","volume-title":"Proceedings of the IIASA Workshop, Nonsmooth Optimization, 1977","author":"C. Lemar\u00e9chal","year":"1978","unstructured":"C. Lemar\u00e9chal, Bundle methods in nonsmooth optimization, in: C. Lemar\u00e9chal and R. Mifflin, eds.,Proceedings of the IIASA Workshop, Nonsmooth Optimization, 1977 (Pergamon Press, Oxford, 1978) 79\u2013102."},{"key":"CR47","volume-title":"A projection method for the floor planning problem","author":"D.M. Mates","year":"1993","unstructured":"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."},{"key":"CR48","volume-title":"Discontinuous piecewise linear optimization","author":"M. Mongeau","year":"1991","unstructured":"M. Mongeau, Discontinuous piecewise linear optimization, Ph.D. Thesis, Dept. of Combinatorics and Optimization, University of Waterloo, Ontario, Canada, 1991."},{"key":"CR49","first-page":"271","volume":"19","author":"B. Montreuil","year":"1987","unstructured":"B. Montreuil, H.D. Ratliff and M. Goetschalckx, Matching based interactive facility layout,AIIE Transactions 19 (1987) 271\u2013279.","journal-title":"AIIE Transactions"},{"key":"CR50","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/0902018","volume":"2","author":"W. Murray","year":"1981","unstructured":"W. Murray and M. Overton, A projected Lagrangian algorithm for nonlinearl 1 optimization,SIAM Journal on Scientific and Statistical Computing 2 (1981) 207\u2013224.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"CR51","volume-title":"Finite Algorithms in Optimization and Data Analysis","author":"M.R. Osborne","year":"1985","unstructured":"M.R. Osborne,Finite Algorithms in Optimization and Data Analysis (John Wiley, New York, 1985)."},{"key":"CR52","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1017\/S0334270000005191","volume":"28","author":"M.R. Osborne","year":"1986","unstructured":"M.R. Osborne, S. Pruess and R.S. Womersley, Concise representation of generalised gradients,Journal of the Australian Mathematical Society 28 (1986) 57\u201374.","journal-title":"Journal of the Australian Mathematical Society"},{"key":"CR53","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1093\/comjnl\/12.1.63","volume":"12","author":"M.R. Osborne","year":"1968","unstructured":"M.R. Osborne and G.A. Watson, An algorithm for minimax approximation in the nonlinear case,Computing Journal 12 (1968) 63\u201368.","journal-title":"Computing Journal"},{"key":"CR54","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0609040","volume":"9","author":"M.L. Overton","year":"1988","unstructured":"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\u2013498.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"CR55","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/0613006","volume":"13","author":"M.L. Overton","year":"1992","unstructured":"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\u201345.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"CR56","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF01585173","volume":"62","author":"M.L. Overton","year":"1993","unstructured":"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\u2013357.","journal-title":"Mathematical Programming"},{"key":"CR57","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1287\/mnsc.36.9.1092","volume":"36","author":"U.S. Palekar","year":"1990","unstructured":"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\u20131105.","journal-title":"Management Science"},{"key":"CR58","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01580776","volume":"41","author":"D.M. Ryan","year":"1988","unstructured":"D.M. Ryan and M.R. Osborne, On the solution of highly degenerate linear programmes,Mathematical Programming 41 (1988) 385\u2013392.","journal-title":"Mathematical Programming"},{"key":"CR59","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0304-4076(79)90040-X","volume":"11","author":"A. Tishler","year":"1979","unstructured":"A. Tishler and I. Zang, A switching regression method using inequality conditions,Journal of Econometrics 11 (1979) 259\u2013274.","journal-title":"Journal of Econometrics"},{"key":"CR60","doi-asserted-by":"crossref","unstructured":"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).","DOI":"10.1109\/43.103499"},{"key":"CR61","first-page":"205","volume":"11","author":"P. Wolfe","year":"1963","unstructured":"P. Wolfe, A technique for resolving degeneracy in linear programming,SIAM Journal 11 (1963) 205\u2013211.","journal-title":"SIAM Journal"},{"key":"CR62","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0120957","volume":"17","author":"R.S. Womersley","year":"1982","unstructured":"R.S. Womersley, Optimality conditions for piecewise smooth functions,Mathematical Programming Study 17 (1982) 13\u201327.","journal-title":"Mathematical Programming Study"},{"key":"CR63","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF01585659","volume":"32","author":"R.S. Womersley","year":"1985","unstructured":"R.S. Womersley, Local properties of algorithms for minimizing nonsmooth composite functions,Mathematical Programming 32 (1985) 69\u201389.","journal-title":"Mathematical Programming"},{"key":"CR64","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1137\/0907008","volume":"7","author":"R.S. Womersley","year":"1986","unstructured":"R.S. Womersley, Censored discrete linearl 1 approximation,SIAM Journal on Scientific and Statistical Computing 7 (1986) 105\u2013122.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"CR65","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/BF00940574","volume":"48","author":"R.S. Womersley","year":"1986","unstructured":"R.S. Womersley and R. Fletcher, An algorithm for composite nonsmooth optimization problems,Journal of Optimization Theory and Applications 48 (1986) 493\u2013523.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR66","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1287\/moor.6.1.140","volume":"6","author":"I. Zang","year":"1981","unstructured":"I. Zang, Discontinuous optimization by smoothing,Mathematics of Operations Research 6 (1981) 140\u2013152.","journal-title":"Mathematics of Operations Research"},{"key":"CR67","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/mnsc.14.1.58","volume":"14","author":"W.I. Zangwill","year":"1967","unstructured":"W.I. Zangwill, An algorithm for the Chebyshev problem \u2014 With an application to concave programming,Management Science 14 (1967) 58\u201378.","journal-title":"Management Science"},{"key":"CR68","first-page":"323","volume-title":"Computational Mathematical Programming, Bad Windsheim, 1984, NATO Advanced Science Institute Series F, Vol. 15","author":"J. Zowe","year":"1985","unstructured":"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\u2013356."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581171.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581171\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581171","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T03:54:50Z","timestamp":1586231690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581171"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":68,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["BF01581171"],"URL":"https:\/\/doi.org\/10.1007\/bf01581171","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}