乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T07:22:36Z","timestamp":1649143356311},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T00:00:00Z","timestamp":1322870400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s10957-011-9967-3","type":"journal-article","created":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T13:45:20Z","timestamp":1322919920000},"page":"388-407","source":"Crossref","is-referenced-by-count":0,"title":["Dual Convergence for Penalty Algorithms in Convex Programming"],"prefix":"10.1007","volume":"153","author":[{"given":"Felipe","family":"Alvarez","sequence":"first","affiliation":[]},{"given":"Miguel","family":"Carrasco","sequence":"additional","affiliation":[]},{"given":"Thierry","family":"Champion","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,12,3]]},"reference":[{"issue":"1","key":"9967_CR1","first-page":"197","volume":"7","author":"F. Alvarez","year":"2000","unstructured":"Alvarez, F.: Absolute minimizer in convex programming by exponential penalty. J. Convex Anal. 7(1), 197\u2013202 (2000)","journal-title":"J. Convex Anal."},{"issue":"1","key":"9967_CR2","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1137\/S1052623401384771","volume":"13","author":"T. Champion","year":"2002","unstructured":"Champion, T.: Tubularity and asymptotic convergence of penalty trajectories in convex programming. SIAM J. Optim. 13(1), 212\u2013227 (2002)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9967_CR3","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1137\/S1052623401397242","volume":"13","author":"R. Cominetti","year":"2003","unstructured":"Cominetti, R., Courdurier, M.: Coupling general penalty schemes for convex programming with the steepest descent and the proximal point algorithm. SIAM J. Optim. 13(3), 745\u2013765 (2003) (electronic)","journal-title":"SIAM J. Optim."},{"key":"9967_CR4","series-title":"Classics in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971316","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"A.V. Fiacco","year":"1990","unstructured":"Fiacco, A.V., McCormick, G.P.: Nonlinear Programming: Sequential Unconstrained Minimization Techniques, 2nd edn. Classics in Applied Mathematics, vol.\u00a04. SIAM, Philadelphia (1990)","edition":"2"},{"issue":"2","key":"9967_CR5","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/1034048","volume":"34","author":"C.G. Gonzaga","year":"1992","unstructured":"Gonzaga, C.G.: Path-following methods for linear programming. SIAM Rev. 34(2), 167\u2013224 (1992)","journal-title":"SIAM Rev."},{"issue":"1","key":"9967_CR6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/moor.22.1.43","volume":"22","author":"A. Auslender","year":"1997","unstructured":"Auslender, A., Cominetti, R., Haddou, M.: Asymptotic analysis for penalty methods in convex and linear programming. Math. Oper. Res. 22(1), 43\u201362 (1997)","journal-title":"Math. Oper. Res."},{"key":"9967_CR7","series-title":"Springer Series in Operations Research and Financial Engineering","volume-title":"Numerical Optimization","author":"J. Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer Series in Operations Research and Financial Engineering. Springer, New York (2006)","edition":"2"},{"issue":"4","key":"9967_CR8","doi-asserted-by":"crossref","first-page":"966","DOI":"10.1287\/moor.1050.0156","volume":"30","author":"F. Alvarez","year":"2005","unstructured":"Alvarez, F., Carrasco, M., Pichard, K.: Convergence of a hybrid projection-proximal point algorithm coupled with approximation methods in convex optimization. Math. Oper. Res. 30(4), 966\u2013984 (2005)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"9967_CR9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10107-002-0295-0","volume":"93","author":"F. Alvarez","year":"2002","unstructured":"Alvarez, F., Cominetti, R.: Primal and dual convergence of a proximal point exponential penalty method for linear programming. Math. Program., Ser. A 93(1), 87\u201396 (2002)","journal-title":"Math. Program., Ser. A"},{"issue":"3","key":"9967_CR10","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1023\/A:1022621905645","volume":"95","author":"R. Cominetti","year":"1997","unstructured":"Cominetti, R.: Coupling the proximal point algorithm with approximation methods. J. Optim. Theory Appl. 95(3), 581\u2013600 (1997)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"9967_CR11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10107-002-0332-z","volume":"96","author":"C.G. Gonzaga","year":"2003","unstructured":"Gonzaga, C.G., Castillo, R.A.: A nonlinear programming algorithm based on non-coercive penalty functions. Math. Program., Ser. A 96(1), 87\u2013101 (2003)","journal-title":"Math. Program., Ser. A"},{"issue":"1","key":"9967_CR12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10107-003-0460-0","volume":"103","author":"J.C. Gilbert","year":"2005","unstructured":"Gilbert, J.C., Gonzaga, C.G., Karas, E.: Examples of ill-behaved central paths in convex optimization. Math. Program., Ser. A 103(1), 63\u201394 (2005)","journal-title":"Math. Program., Ser. A"},{"key":"9967_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S. Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"9967_CR14","series-title":"Princeton Landmarks in Mathematics","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1997","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton Landmarks in Mathematics. Princeton University Press, Princeton (1997). Reprint of the 1970 original, Princeton Paperbacks"},{"issue":"3","key":"9967_CR15","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1137\/S1052623493259616","volume":"6","author":"H. Attouch","year":"1996","unstructured":"Attouch, H.: Viscosity solutions of minimization problems. SIAM J. Optim. 6(3), 769\u2013806 (1996)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9967_CR16","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/S0363012995290744","volume":"37","author":"A.N. Iusem","year":"1999","unstructured":"Iusem, A.N., Svaiter, B.F., Da Cruz\u00a0Neto, J.X.: Central paths, generalized proximal point methods, and Cauchy trajectories in Riemannian manifolds. SIAM J. Control Optim. 37(2), 566\u2013588 (1999)","journal-title":"SIAM J. Control Optim."},{"key":"9967_CR17","series-title":"Springer Monographs in Mathematics","volume-title":"Asymptotic Cones and Functions in Optimization and Variational Inequalities","author":"A. Auslender","year":"2003","unstructured":"Auslender, A., Teboulle, M.: Asymptotic Cones and Functions in Optimization and Variational Inequalities. Springer Monographs in Mathematics. Springer, New York (2003)"},{"key":"9967_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00939042","volume":"55","author":"A. Auslender","year":"1987","unstructured":"Auslender, A., Crouzeix, J.P., Fedit, P.: Penalty-proximal methods in convex programming. J. Optim. Theory Appl. 55, 1\u201321 (1987)","journal-title":"J. Optim. Theory Appl."},{"key":"9967_CR19","first-page":"795","volume":"19","author":"A. Kaplan","year":"1978","unstructured":"Kaplan, A.: On a convex programming method with internal regularization. Sov. Math. Dokl. 19, 795\u2013799 (1978)","journal-title":"Sov. Math. Dokl."},{"issue":"2","key":"9967_CR20","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1023\/A:1022693618829","volume":"98","author":"A. Kaplan","year":"1998","unstructured":"Kaplan, A., Tichatschke, R.: Proximal point methods in view of interior-point strategies. J. Optim. Theory Appl. 98(2), 399\u2013429 (1998)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"9967_CR21","first-page":"46","volume":"37","author":"I.V. Konnov","year":"1993","unstructured":"Konnov, I.V.: Combined relaxation methods for the search for equilibrium points and solutions of related problems. Izv. Vys\u0161. U\u010debn. Zaved., Mat. 37(2), 46\u201353 (1993)","journal-title":"Izv. Vys\u0161. U\u010debn. Zaved., Mat."},{"issue":"1","key":"9967_CR22","first-page":"59","volume":"6","author":"M.V. Solodov","year":"1999","unstructured":"Solodov, M.V., Svaiter, B.F.: A hybrid projection-proximal point algorithm. J. Convex Anal. 6(1), 59\u201370 (1999)","journal-title":"J. Convex Anal."},{"issue":"4","key":"9967_CR23","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1023\/A:1008777829180","volume":"7","author":"M.V. Solodov","year":"1999","unstructured":"Solodov, M.V., Svaiter, B.F.: A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator. Set-Valued Anal. 7(4), 323\u2013345 (1999)","journal-title":"Set-Valued Anal."},{"key":"9967_CR24","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1090\/S0002-9939-1965-0178103-8","volume":"16","author":"A. Br\u00f8ndsted","year":"1965","unstructured":"Br\u00f8ndsted, A., Rockafellar, R.T.: On the subdifferentiability of convex functions. Proc. Am. Math. Soc. 16, 605\u2013611 (1965)","journal-title":"Proc. Am. Math. Soc."},{"issue":"2","key":"9967_CR25","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02190058","volume":"83","author":"R. Cominetti","year":"1994","unstructured":"Cominetti, R., Dussault, J.-P.: Stable exponential-penalty algorithm with superlinear convergence. J.\u00a0Optim. Theory Appl. 83(2), 285\u2013309 (1994)","journal-title":"J.\u00a0Optim. Theory Appl."},{"issue":"1","key":"9967_CR26","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/02331939708844268","volume":"39","author":"R. Cominetti","year":"1997","unstructured":"Cominetti, R., P\u00e9rez-Cerda, J.M.: Quadratic rate of convergence for a primal-dual exponential penalty algorithm. Optimization 39(1), 13\u201332, (1997)","journal-title":"Optimization"},{"issue":"1","key":"9967_CR27","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/0732012","volume":"32","author":"J.-P. Dussault","year":"1995","unstructured":"Dussault, J.-P.: Numerical stability and efficiency of penalty algorithms. SIAM J. Numer. Anal. 32(1), 296\u2013317 (1995)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"9967_CR28","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1137\/S1052623496305882","volume":"9","author":"F. Facchinei","year":"1999","unstructured":"Facchinei, F., Fischer, A., Kanzow, C.: On the accurate identification of active constraints. SIAM J. Optim. 9(1), 14\u201332 (1999) (electronic)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9967_CR29","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1137\/050626776","volume":"17","author":"C. Oberlin","year":"2006","unstructured":"Oberlin, C., Wright, S.J.: Active set identification in nonlinear programming. SIAM J. Optim. 17(2), 577\u2013605 (2006) (electronic)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9967_CR30","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/030601235","volume":"15","author":"S.J. Wright","year":"2005","unstructured":"Wright, S.J.: An algorithm for degenerate nonlinear programming with rapid local convergence. SIAM J. Optim. 15(3), 673\u2013696 (2005) (electronic)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-011-9967-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-011-9967-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-011-9967-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:55:14Z","timestamp":1559454914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-011-9967-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,3]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["9967"],"URL":"https:\/\/doi.org\/10.1007\/s10957-011-9967-3","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,3]]}}}