{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T04:05:33Z","timestamp":1778904333029,"version":"3.51.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,11,1]],"date-time":"1995-11-01T00:00:00Z","timestamp":815184000000},"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":[[1995,11]]},"DOI":"10.1007\/bf01592244","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T20:01:22Z","timestamp":1114718482000},"page":"51-69","source":"Crossref","is-referenced-by-count":201,"title":["Smoothing methods for convex inequalities and linear complementarity problems"],"prefix":"10.1007","volume":"71","author":[{"given":"Chunhui","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O. L.","family":"Mangasarian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"The Linear Complementarity Problem","author":"R.W. Cottle","year":"1992","unstructured":"R.W. Cottle, J.-S. Pang and R.E. Stone,The Linear Complementarity Problem (Academic Press, New York, 1992)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1002\/cpe.4330050802","volume":"5","author":"R. Leone De","year":"1993","unstructured":"R. De Leone and M.A. Tork Roth, \u201cMassively parallel solution of quadratic programs via successive overrelaxation,\u201dConcurrency: Practice and Experience 5 (1993) 623\u2013634.","journal-title":"Concurrency: Practice and Experience"},{"key":"CR3","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"J.E. Dennis","year":"1983","unstructured":"J.E. Dennis and R.B. Schnabel,Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Prentice-Hall, Englewood Cliffs, NJ, 1983)."},{"key":"CR4","volume-title":"\u201cThe path solver: A non-monotone stabilization scheme for mixed complementarity problems,\u201d Technical Report 1179","author":"S.P. Dirkse","year":"1993","unstructured":"S.P. Dirkse and M.C. Ferris, \u201cThe path solver: A non-monotone stabilization scheme for mixed complementarity problems,\u201d Technical Report 1179, Computer Sciences Department, University of Wisconsin, Madison, WI, 1993."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"263","DOI":"10.6028\/jres.049.027","volume":"49","author":"A.J. Hoffman","year":"1952","unstructured":"A.J. Hoffman, \u201cOn approximate solutions of systems of linear inequalities,\u201dJournal of Research of the National Bureau of Standards 49 (1952) 263\u2013265.","journal-title":"Journal of Research of the National Bureau of Standards"},{"issue":"1","key":"CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01587074","volume":"44","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cA polynomial-time algorithm for a class of linear complementarity problems,\u201dMathematical Programming 44 (1) (1989) 1\u201326.","journal-title":"Mathematical Programming"},{"issue":"2","key":"CR7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/0803010","volume":"3","author":"K. Madsen","year":"1993","unstructured":"K. Madsen and H.B. Nielsen, \u201cA finite smoothing algorithm for linearl 1 estimation,\u201dSIAM Journal on Optimization 3 (2) (1993) 223\u2013235.","journal-title":"SIAM Journal on Optimization"},{"key":"CR8","first-page":"3","volume-title":"Proceedings of 6. Symposium \u00fcber Operations Research, Augsburg, 1981","author":"O.L. Mangasarian","year":"1981","unstructured":"O.L. Mangasarian, \u201cA condition number for linear inequalities and linear programs,\u201d in: G. Bamberg and O. Opitz, eds.,Proceedings of 6. Symposium \u00fcber Operations Research, Augsburg, 1981 (Atheneum\/Hain\/Scriptor\/Hanstein, K\u00f6nigstein, 1981) pp. 3\u201315."},{"issue":"2","key":"CR9","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1287\/moor.10.2.175","volume":"10","author":"O.L. Mangasarian","year":"1985","unstructured":"O.L. Mangasarian, \u201cA condition number for differentiable convex inequalities,\u201dMathematics of Operations Research 10 (2) (1985) 175\u2013179.","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"CR10","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1287\/ijoc.5.4.349","volume":"5","author":"O.L. Mangasarian","year":"1993","unstructured":"O.L. Mangasarian, \u201cMathematical programming in neural networks,\u201dORSA Journal on Computing 5 (4) (1993) 349\u2013360.","journal-title":"ORSA Journal on Computing"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0167-6377(94)90076-0","volume":"15","author":"O.L. Mangasarian","year":"1994","unstructured":"O.L. Mangasarian, \u201cError bounds for inconsistent linear inequalities and programs,\u201dOperations Research Letters 15 (1994) 187\u2013192.","journal-title":"Operations Research Letters"},{"issue":"2","key":"CR12","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01581148","volume":"66","author":"O.L. Mangasarian","year":"1994","unstructured":"O.L. Mangasarian and J. Ren, \u201cNew improved error bounds for the linear complementarity problem,\u201dMathematical Programming 66 (2) (1994) 241\u2013255.","journal-title":"Mathematical Programming"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"393","DOI":"10.4153\/CJM-1954-038-x","volume":"6","author":"T.S. Motzkin","year":"1954","unstructured":"T.S. Motzkin and I.J. Schoenberg, \u201cThe relaxation method for linear inequalities,\u201dCanadian Journal of Mathematics 6 (1954) 393\u2013404.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR14","volume-title":"\u201cMINOS 5.0 user's guide,\u201d Technical Report SOL 83.20","author":"B.A. Murtagh","year":"1983","unstructured":"B.A. Murtagh and M.A. Saunders, \u201cMINOS 5.0 user's guide,\u201d Technical Report SOL 83.20, Stanford University, Stanford, CA, 1983."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0721052","volume":"21","author":"S.G. Nash","year":"1984","unstructured":"S.G. Nash, \u201cNewton-type minimization via the Lanczos method,\u201dSIAM Journal of Numerical Analysis 21 (1984) 770\u2013778.","journal-title":"SIAM Journal of Numerical Analysis"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"J. Nocedal, \u201cTheory of algorithms for unconstrained optimization,\u201dActa Numerica (1992) 199\u2013242.","DOI":"10.1017\/S0962492900002270"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1137\/0804027","volume":"4","author":"M.C. Pinar","year":"1994","unstructured":"M.C. Pinar and S.A. Zenios, \u201cOn smoothing exact penalty functions for convex constrained optimization,\u201dSIAM Journal on Optimization 4 (1994) 486\u2013511.","journal-title":"SIAM Journal on Optimization"},{"key":"CR18","volume-title":"\u201cComputable error bounds in mathematical programming,\u201d Technical Report 1173","author":"J. Ren","year":"1993","unstructured":"J. Ren, \u201cComputable error bounds in mathematical programming,\u201d Technical Report 1173, Computer Sciences Department, University of Wisconsin, Madison, WI, 1993."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1137\/0313015","volume":"13","author":"S.M. Robinson","year":"1975","unstructured":"S.M. Robinson, \u201cApplication of error bounds for convex programming in a linear space,\u201dSIAM Journal on Control and Optimization 13 (1975) 271\u2013273.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR20","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01592244.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01592244\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01592244","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:47:52Z","timestamp":1556898472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01592244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["BF01592244"],"URL":"https:\/\/doi.org\/10.1007\/bf01592244","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}