{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:35:38Z","timestamp":1725518138416},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540859833"},{"type":"electronic","value":"9783540859840"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85984-0_88","type":"book-chapter","created":{"date-parts":[[2008,9,7]],"date-time":"2008-09-07T17:00:48Z","timestamp":1220806848000},"page":"734-741","source":"Crossref","is-referenced-by-count":0,"title":["A Wide Neighborhood Primal-Dual Interior-Point Algorithm for a Class of Convex Programming"],"prefix":"10.1007","author":[{"given":"Yuqin","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Mingwang","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"88_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01585553","volume":"69","author":"D. Hertog","year":"1995","unstructured":"Hertog, D., Jarre, F., Roos, C., Terlaky, T.: A Sufficient Condition for Self-concordance, With Application to Some Classes of Structured Convex Programming problems. Mathematical Programming\u00a069, 5\u201388 (1995)","journal-title":"Mathematical Programming"},{"key":"88_CR2","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1016\/0005-1098(93)90049-Y","volume":"29","author":"J. Richalet","year":"1993","unstructured":"Richalet, J.: Industrial Applications of Model Based Predictive Control. Automatiea\u00a029, 1251\u20131274 (1993)","journal-title":"Automatiea"},{"key":"88_CR3","first-page":"215","volume":"3","author":"M.W. Zhang","year":"2000","unstructured":"Zhang, M.W., Huang, C.C., Lai, Y.F.: An Interior Ellipsoid Method for Linearly Constrained Convex Programming. Numerical Mathematics A Journal of Chinese Universities\u00a03, 215\u2013221 (2000)","journal-title":"Numerical Mathematics A Journal of Chinese Universities"},{"key":"88_CR4","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N.K. Karmarkar","year":"1984","unstructured":"Karmarkar, N.K.: A New Polynomial-time Algorithm for Limear Programming. Combinatorica\u00a04, 373\u2013395 (1984)","journal-title":"Combinatorica"},{"key":"88_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"Monteiro, R.D.C., Alder, I.: Interior Path Following Primal-dual Interior Point Algorithm Part II: Convex quadratic programming. Mathematical Programming\u00a044, 43\u201366 (1989)","journal-title":"Mathematical Programming"},{"key":"88_CR6","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1287\/moor.15.3.408","volume":"15","author":"R.D.C. Monteiro","year":"1990","unstructured":"Monteiro, R.D.C., Alder, I.: An Extension of Karmarkar Type Algorithm to A Class of Convex Separable Programming Problems with Global Linear Rate of Convergence. Mathematics of Operations Research\u00a015, 408\u2013422 (1990)","journal-title":"Mathematics of Operations Research"},{"key":"88_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF01582568","volume":"64","author":"R.D.C. Monteiro","year":"1994","unstructured":"Monteiro, R.D.C.: A Globally Convergent Primal-dual Interior Point Algorithm for Convex Problem. Mathematical Programming\u00a064, 123\u2013147 (1994)","journal-title":"Mathematical Programming"},{"key":"88_CR8","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1287\/moor.18.4.964","volume":"18","author":"S. Mizuno","year":"1993","unstructured":"Mizuno, S., Todd, M.J., Ye, Y.: On Adaptive-step Primal-dual Interior-point Algorithm for Linear Programming. Mathematics of Operations Research\u00a018, 964\u2013981 (1993)","journal-title":"Mathematics of Operations Research"},{"key":"88_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0959-1524(98)00011-0","volume":"8","author":"S. Boyd","year":"1998","unstructured":"Boyd, S., Crusius, C., Hansson, A.: Control Applications of Nonlinear Convex Programming. Journal of Process Control\u00a08, 313\u2013324 (1998)","journal-title":"Journal of Process Control"},{"key":"88_CR10","volume-title":"Linear Optimization and Extensions: Theory and Algorithms[M]","author":"S.C. Fang","year":"1993","unstructured":"Fang, S.C., Puthenpura, S.: Linear Optimization and Extensions: Theory and Algorithms[M]. Prentice Hall, New Jersey (1993)"},{"key":"88_CR11","volume-title":"Interior Point Algorithms: Theory and Analysis","author":"Y. Ye","year":"1995","unstructured":"Ye, Y.: Interior Point Algorithms: Theory and Analysis. John Wiley & Sons, Chichester (1995)"},{"key":"88_CR12","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1023\/A:1022606324827","volume":"102","author":"Y.B. Zhao","year":"1999","unstructured":"Zhao, Y.B., Han, J.Y.: Two Interior-point Methods for Nonlinear Complementarity Problems. Journal of optimization theory and applications\u00a0102, 659\u2013679 (1999)","journal-title":"Journal of optimization theory and applications"},{"key":"88_CR13","first-page":"509","volume":"24","author":"Y.E. Nesterov","year":"1988","unstructured":"Nesterov, Y.E., Nemirovsky, A.S.: A General Approach to the Design of Optimal Methods for Smooth Convex Functions Minimization. Ekonomika i Matem, Metody\u00a024, 509\u2013517 (1988)","journal-title":"Ekonomika i Matem, Metody"},{"key":"88_CR14","unstructured":"Nesterov, Y.E., Nemirovsky, A.S.: Self-concordant Functions and Polynomial Time Methods in Convex Programming. Central Economic & Mathematical Institute, USSR Acadamy of Science, Moscow, USSR (preprint, 1989)"},{"key":"88_CR15","unstructured":"Nesterov, Y.E.: Interior Point Methods in Convex Programming: Theory and Applications. Society for Industrial and Applied Mathematics, Philadelphia (1994)"}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85984-0_88","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T05:42:51Z","timestamp":1580362971000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85984-0_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540859833","9783540859840"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85984-0_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}