{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T17:13:34Z","timestamp":1782407614954,"version":"3.54.5"},"reference-count":29,"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\/bf01592246","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T20:01:22Z","timestamp":1114718482000},"page":"77-100","source":"Crossref","is-referenced-by-count":26,"title":["An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities"],"prefix":"10.1007","volume":"71","author":[{"given":"Alfred","family":"Auslender","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mounir","family":"Haddou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Optimisation \u2014 Methodes Num\u00e9riques","author":"A. Auslender","year":"1976","unstructured":"A. Auslender,Optimisation \u2014 Methodes Num\u00e9riques (Masson, Paris, 1976)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF02756796","volume":"23","author":"H. Brezis","year":"1976","unstructured":"H. Brezis and A. Haraux, \u201cImage d'une somme d'operateurs monotones et applications,\u201dIsrael Journal on Mathematics 23 (1976) 165\u2013186.","journal-title":"Israel Journal on Mathematics"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/BF00940051","volume":"73","author":"Y. Censor","year":"1992","unstructured":"Y. Censor and S. Zenios, \u201cThe proximal minimization algorithm with D-functions,\u201dJournal of Optimization Theory and Applications 73 (1992) 451\u2013464.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1137\/0803026","volume":"3","author":"G. Chen","year":"1993","unstructured":"G. Chen and M. Teboulle, \u201cConvergence analysis of proximal-like optimization algorithm using Bregman functions,\u201dSIAM Journal on Optimization 3 (1993) 538\u2013543.","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"CR5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF01582220","volume":"67","author":"R. Cominetti","year":"1994","unstructured":"R. Cominetti and J. San Mart\u00edn, \u201cAsymptotic analysis of the exponential penalty trajectory in linear programming,\u201dMathematical Programming 67 (2) (1994) 169\u2013187.","journal-title":"Mathematical Programming"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1287\/moor.18.1.202","volume":"18","author":"J. Eckstein","year":"1993","unstructured":"J. Eckstein, \u201cNonlinear proximal point algorithms using Bregman functions, with applications to convex programming,\u201dMathematics of Operations Research 18 (1993) 202\u2013226.","journal-title":"Mathematics of Operations Research"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0024-3795(90)90204-P","volume":"130","author":"P.P.B. Eggermont","year":"1990","unstructured":"P.P.B. Eggermont, \u201cMultiplicative iterative algorithms for convex programming,\u201dLinear Algebra and its Applications 130 (1990) 25\u201342.","journal-title":"Linear Algebra and its Applications"},{"key":"CR8","volume-title":"The logarithmic potential method of convex programming","author":"K.R. Frisch","year":"1955","unstructured":"K.R. Frisch, \u201cThe logarithmic potential method of convex programming,\u201d Memorandum, University Institute of Economics, Oslo, Norway (1955)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02592025","volume":"36","author":"P.E. Gill","year":"1986","unstructured":"P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin and M.H. Wright, \u201cOn projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method,\u201dMathematical Programming 36 (1986) 183\u2013209.","journal-title":"Mathematical Programming"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01582888","volume":"52","author":"C.C. Gonzaga","year":"1991","unstructured":"C.C. Gonzaga, \u201cInterior point algorithm for linear programming with inequality constraints,\u201dMathematical Programming 52 (1991) 209\u2013226.","journal-title":"Mathematical Programming"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/1034048","volume":"34","author":"C.C. Gonzaga","year":"1992","unstructured":"C.C. Gonzaga, \u201cPath-following methods for linear programming,\u201dSIAM Review 34 (1992) 167\u2013224.","journal-title":"SIAM Review"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1287\/moor.18.1.128","volume":"18","author":"O. G\u00fcler","year":"1993","unstructured":"O. G\u00fcler, \u201cExistence of interior points and interior paths in nonlinear monotone complementarity problems,\u201dMathematics of Operations Research 18 (1993) 128\u2013147.","journal-title":"Mathematics of Operations Research"},{"key":"CR13","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 the National Bureau of Standards 49 (1952) 263\u2013265.","journal-title":"Journal of the National Bureau of Standards"},{"key":"CR14","first-page":"207","volume-title":"Nonlinear Programming","author":"P. Huard","year":"1967","unstructured":"P. Huard, \u201cResolution of mathematical programming with nonlinear constraints by the method of centers nonlinear programming,\u201d in: J. Abadie, ed.,Nonlinear Programming (North-Holland, Amsterdam, 1967) pp. 207\u2013219."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1287\/moor.19.4.790","volume":"19","author":"A.N. Iusem","year":"1994","unstructured":"A.N. Iusem, B.F. Svaiter and M. Teboulle, \u201cEntropy-like proximal methods in convex programming,\u201dMathematics of Operations Research 19 (1994) 790\u2013814.","journal-title":"Mathematics of Operations Research"},{"key":"CR16","volume-title":"\u201cConvergence rate analysis of nonquadratic proximal and augmented Lagrangian methods for convex and linear programming,\u201d Technical Report 92-17","author":"N. Iusem","year":"1992","unstructured":"N. Iusem and M. Teboulle, \u201cConvergence rate analysis of nonquadratic proximal and augmented Lagrangian methods for convex and linear programming,\u201d Technical Report 92-17, Department of Mathematics and Statistics, University of Maryland, Baltimore, MD (1992)."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, \u201cA new polynomial time algorithm for linear programming,\u201dCombinatorica 4 (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"CR18","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 linear complementarity problems,\u201dMathematical Programming 44 (1989) 1\u201326.","journal-title":"Mathematical Programming"},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"B. Martinet, \u201cPerturbation des methodes d' optimisation, applications,\u201dR.A.I.R.O. Analyse Num\u00e9rique (1978) 153\u2013171.","DOI":"10.1051\/m2an\/1978120201531"},{"key":"CR20","first-page":"131","volume-title":"Interior Points and Related Methods","author":"N. Megiddo","year":"1989","unstructured":"N. Megiddo, \u201cPathways to the optimal set in linear programming,\u201d in: N. Megiddo, ed.,Interior Points and Related Methods (Springer, New York, 1989) pp. 131\u2013158."},{"key":"CR21","first-page":"135","volume":"3","author":"G.J.M. Minty","year":"1967","unstructured":"G.J.M. Minty, \u201cOn the maximal domain of a monotone function,\u201dMichigan Mathematical Journal 3 (1967) 135\u2013137.","journal-title":"Michigan Mathematical Journal"},{"key":"CR22","unstructured":"Y. Nesterov and A. Nemirovsky, \u201cPath-following polynomial time algorithm for monotone variational inequalities,\u201d Research Report 4224, Central Economic and Mathematical Institute, Mathematical Departement, USSR Academy of Sciences (1991)."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01580724","volume":"40","author":"J. Renegar","year":"1988","unstructured":"J. Renegar, \u201cA polynomial-time algorithm, based on Newton's method, for linear programming,\u201dMathematical Programming 40 (1988) 59\u201394.","journal-title":"Mathematical Programming"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1090\/S0002-9947-1970-0282272-5","volume":"149","author":"R.T. Rockafellar","year":"1970","unstructured":"R.T. Rockafellar, \u201cOn the maximality of sums of nonlinear monotone operators,\u201dTransactions of the American Mathematical Society 149 (1970) 75\u201388.","journal-title":"Transactions of the American Mathematical Society"},{"key":"CR25","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)."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/BF00939806","volume":"3","author":"C. Roos","year":"1989","unstructured":"C. Roos, \u201cNew trajectory-following polynomial-time algorithm for linear programming problems,\u201dJournal of Optimization Theory and Applications 3 (1989) 433\u2013458.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR27","first-page":"866","volume-title":"Lecture Notes in Control and Information Sciences, Vol. 84","author":"G.Y. Sonnevend","year":"1985","unstructured":"G.Y. Sonnevend, \u201cAn analytic center for polyhedrons and new class of global algorithms for linear (smooth, convex) programming,\u201d in: Lecture Notes in Control and Information Sciences, Vol. 84 (Springer, New York, 1985) pp. 866\u2013876."},{"key":"CR28","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1287\/moor.17.3.670","volume":"17","author":"M. Teboulle","year":"1992","unstructured":"M. Teboulle, \u201cEntropic proximal mappings with applications to nonlinear programming,\u201dMathematics of Operations Research 17 (1992) 670\u2013690.","journal-title":"Mathematics of Operations Research"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01580859","volume":"47","author":"P.M. Vaidya","year":"1990","unstructured":"P.M. Vaidya, \u201cAn algorithm for linear programming which requires O((m + n)n 2 + (m + n)1,5 n)L) arithmetic operations,\u201dMathematical Programming 47 (1990) 175\u2013202.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01592246.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01592246\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01592246","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T04:17:29Z","timestamp":1586233049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01592246"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["BF01592246"],"URL":"https:\/\/doi.org\/10.1007\/bf01592246","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}