{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T09:00:12Z","timestamp":1648890012705},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1007\/bf02108465","type":"journal-article","created":{"date-parts":[[2005,9,13]],"date-time":"2005-09-13T22:15:16Z","timestamp":1126649716000},"page":"309-323","source":"Crossref","is-referenced-by-count":4,"title":["A projected conjugate gradient method for sparse minimax problems"],"prefix":"10.1007","volume":"5","author":[{"given":"Kristj\u00e1n","family":"J\u00f3nasson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02108465_CR1","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01394450","volume":"28","author":"D.H. Andersson","year":"1977","unstructured":"D.H. Andersson and M.R. Osborne, Discrete nonlinear approximation in polyhedral norms: a Levenberg-like algorithm, Numer. Math. 28 (1977) 157\u2013170.","journal-title":"Numer. Math."},{"key":"BF02108465_CR2","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1137\/0715011","volume":"15","author":"C. Charalambous","year":"1978","unstructured":"C. Charalambous and A.R. Conn, An efficient method to solve the minimax problem directly, SIAM J. Numer. Anal. 15 (1978) 162\u2013187.","journal-title":"SIAM J. Numer. Anal."},{"key":"BF02108465_CR3","volume-title":"Report CCRR 79-5","author":"A.R. Conn","year":"1979","unstructured":"A.R. Conn, An efficient second order method to solve the (constrained) minimax problem, Report CCRR 79-5, Dept. of Combinatorics and Optimization, Univ. of Waterloo, Canada (1979)."},{"key":"BF02108465_CR4","doi-asserted-by":"crossref","unstructured":"A.R. Conn, N.I.M. Gould and Ph.L. Toint,LANCELOT: A Fortran Package for Large Scale Nonlinear Optimization (Release A) (Springer, 1992).","DOI":"10.1007\/978-3-662-12211-2"},{"key":"BF02108465_CR5","unstructured":"A.R. Conn and Yuying Li, An efficient algorithm for nonlinear minimax problems, University of Waterloo report CS-88-41 (1989)."},{"key":"BF02108465_CR6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01390337","volume":"29","author":"L. Cromme","year":"1978","unstructured":"L. Cromme, Strong uniqueness, Numer. Math. 29 (1978) 179\u2013194.","journal-title":"Numer. Math."},{"key":"BF02108465_CR7","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, Math. Prog. Study 17 (1982) 67\u201376.","journal-title":"Math. Prog. Study"},{"key":"BF02108465_CR8","unstructured":"R. Fletcher,Practical Methods of Optimization, 2nd ed. (Wiley, 1987)."},{"key":"BF02108465_CR9","unstructured":"R. Fletcher, Low storage methods for unconstrained optimization, Report NA117, Dept. of Math. Sciences, University of Dundee (1988)."},{"key":"BF02108465_CR10","doi-asserted-by":"crossref","unstructured":"R. Fletcher and E. Sainz de la Maza, Nonlinear programming and nonsmooth optimization by successive linear programming, Math. Prog. 43 (1989).","DOI":"10.1007\/BF01582292"},{"key":"BF02108465_CR11","unstructured":"J. Hald, MMLA1Q, a FORTRAN subroutine for linearly constrained minimax optimization, Report no. NI-81-01, Inst. for Numer. Anal., Technical University of Denmark (1981)."},{"key":"BF02108465_CR12","doi-asserted-by":"crossref","unstructured":"J. Hald and K. Madsen, Combined LP and quasi-Newton methods for minimax optimization, Math. Prog. 20 (1981).","DOI":"10.1007\/BF01589332"},{"key":"BF02108465_CR13","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, Math. Prog. 20 (1981) 1\u201313.","journal-title":"Math. Prog."},{"key":"BF02108465_CR14","series-title":"Lect. Notes in Math. 556","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/BFb0087410","volume-title":"Approximation Theory","author":"R. Hettich","year":"1976","unstructured":"R. Hettich, A Newton-method for nonlinear Chebyshev approximation, in:Approximation Theory, eds. R. Schaback and K. Scherer, Lect. Notes in Math. 556 (Springer, Berlin, 1976) pp. 222\u2013236."},{"key":"BF02108465_CR15","unstructured":"K. J\u014dnasson and K. Madsen, Corrected sequential linear programming for sparse minimax optimization, Report NI-92-06, Inst. for Numer. Anal., Technical University of Denmark (1992)."},{"key":"BF02108465_CR16","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1093\/imamat\/16.3.321","volume":"16","author":"K. Madsen","year":"1975","unstructured":"K. Madsen, An algorithm for minimax solution of over-determined systems of non-linear equations, J. Inst. Math. Appl. 16 (1975) 321\u2013328.","journal-title":"J. Inst. Math. Appl."},{"key":"BF02108465_CR17","unstructured":"K. Madsen, O. Tingleff, P.Chr. Hansen and W. Owczarc, Robust subroutines for non-linear optimization, Report NI-90-06, Inst. for Numer. Anal., Technical University of Denmark (1990)."},{"key":"BF02108465_CR18","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1137\/0901025","volume":"1","author":"W. Murray","year":"1980","unstructured":"W. Murray and M.L. Overton, A projected Lagrangian algorithm for nonlinear minimax optimization, SIAM J. Sci. Stat. Comp. 1 (1980) 345\u2013370.","journal-title":"SIAM J. Sci. Stat. Comp."},{"key":"BF02108465_CR19","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1093\/comjnl\/12.1.63","volume":"12","author":"M.R. Osborne","year":"1969","unstructured":"M.R. Osborne and G.A. Watson, An algorithm for minimax optimization in the non-linear case, Comp. J. 12 (1969) 63\u201368.","journal-title":"Comp. J."},{"key":"BF02108465_CR20","unstructured":"G. Di Pillo, L. Grippo and S. Lucidi, A smooth method for the finite minimax problem, Report Rap.05.92, Dipartimento di Informatica e Sistematica, Universit\u00e0 di Roma (1992)."},{"key":"BF02108465_CR21","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1093\/imamat\/23.2.167","volume":"23","author":"G.A. Watson","year":"1979","unstructured":"G.A. Watson, The minimax solution of an overdetermined system of non-linear equations, J. Inst. Math. Appl. 23 (1979) 167\u2013180.","journal-title":"J. Inst. Math. Appl."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02108465.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02108465\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02108465","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T12:06:17Z","timestamp":1586433977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02108465"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["BF02108465"],"URL":"https:\/\/doi.org\/10.1007\/bf02108465","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}