{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T08:13:45Z","timestamp":1762157625323},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2007,5,25]],"date-time":"2007-05-25T00:00:00Z","timestamp":1180051200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2009,1]]},"DOI":"10.1007\/s10107-007-0110-z","type":"journal-article","created":{"date-parts":[[2007,5,25]],"date-time":"2007-05-25T07:06:54Z","timestamp":1180076814000},"page":"553-578","source":"Crossref","is-referenced-by-count":15,"title":["Some convex programs without a duality gap"],"prefix":"10.1007","volume":"116","author":[{"given":"Paul","family":"Tseng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,5,25]]},"reference":[{"key":"110_CR1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/PL00011377","volume":"88","author":"A. Auslender","year":"2000","unstructured":"Auslender A. (2000). Existence of optimal solutions and duality results under weak conditions. Math. Program. 88: 45\u201359","journal-title":"Math. Program."},{"key":"110_CR2","volume-title":"Asymptotic Cones and Functions in Optimization and Variational Inequalities","author":"A. Auslender","year":"2003","unstructured":"Auslender A. and Teboulle M. (2003). Asymptotic Cones and Functions in Optimization and Variational Inequalities. Springer, New York"},{"key":"110_CR3","volume-title":"Nonlinear Programming: Theory and Algorithms","author":"M.S. Bazaraa","year":"1993","unstructured":"Bazaraa M.S., Sherali H.D. and Shetty C.M. (1993). Nonlinear Programming: Theory and Algorithms. Wiley, New York"},{"key":"110_CR4","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1137\/S1052623493259215","volume":"7","author":"A. Ben-Tal","year":"1997","unstructured":"Ben-Tal A. and Zibulevsky M. (1997). Penalty\/barrier multiplier methods for convex programming problems. SIAM J. Optim. 7: 347\u2013366","journal-title":"SIAM J. Optim."},{"key":"110_CR5","unstructured":"Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Academic, New York (1982); republished by Athena Scientific, Belmont (1999)"},{"key":"110_CR6","volume-title":"Nonlinear Programming, 2nd edn","author":"D.P. Bertsekas","year":"1999","unstructured":"Bertsekas D.P. (1999). Nonlinear Programming, 2nd edn. Athena Scientific, Belmont"},{"key":"110_CR7","volume-title":"Convex Analysis and Optimization","author":"D.P. Bertsekas","year":"2003","unstructured":"Bertsekas D.P., Nedi\u0107 A. and Ozdaglar A.E. (2003). Convex Analysis and Optimization. Athena Scientific, Belmont"},{"key":"110_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-9859-3","volume-title":"Convex Analysis and Nonlinear Optimization: Theory and Examples","author":"J.M. Borwein","year":"2000","unstructured":"Borwein J.M. and Lewis A.S. (2000). Convex Analysis and Nonlinear Optimization: Theory and Examples. Springer, New York"},{"key":"110_CR9","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s10107-003-0461-z","volume":"99","author":"T. Champion","year":"2004","unstructured":"Champion T. (2004). Duality gap in convex programming. Math. Program. 99: 487\u2013498","journal-title":"Math. Program."},{"key":"110_CR10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10957-004-1712-8","volume":"125","author":"N. Dinh","year":"2005","unstructured":"Dinh N., Jeyakumar V. and Lee G.M. (2005). Sequential Lagrangian conditions for convex programs with applications to semidefinite programming. J. Optim. Theory Appl. 125: 85\u2013112","journal-title":"J. Optim. Theory Appl."},{"key":"110_CR11","unstructured":"Golstein, E.G.: Theory of Convex Programming. English translation by K. Makowski. American Mathematical Society, Providence (1972)"},{"key":"110_CR12","doi-asserted-by":"crossref","first-page":"263","DOI":"10.6028\/jres.049.027","volume":"49","author":"A.J. Hoffman","year":"1952","unstructured":"Hoffman A.J. (1952). On approximate solutions of systems of linear inequalities. J. Res. Natl. Bur. Stand. 49: 263\u2013265","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"110_CR13","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1137\/S0363012995281742","volume":"35","author":"K.C. Kiwiel","year":"1997","unstructured":"Kiwiel K.C. (1997). Proximal minimization methods with generalized Bregman functions. SIAM J. Control Optim. 35: 1142\u20131168","journal-title":"SIAM J. Control Optim."},{"key":"110_CR14","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BFb0121216","volume":"21","author":"D. Klatte","year":"1984","unstructured":"Klatte D. (1984). sufficient condition for lower semicontinuity of solution sets of systems of convex inequalities. Math. Program. Study 21: 139\u2013149","journal-title":"Math. Program. Study"},{"key":"110_CR15","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s10107-003-0419-1","volume":"99","author":"L.A. Korf","year":"2004","unstructured":"Korf L.A. (2004). Stochastic programming duality: L \u221e multipliers for unbounded constraints with an application to mathematical finance. Math. Program. 99: 241\u2013259","journal-title":"Math. Program."},{"key":"110_CR16","unstructured":"Kummer, B.: Stability and weak duality in convex programming without regularity. Wissenschaftliche Zeitschrift der Humboldt-Universit\u00e4t zu Berlin, Math. Nat. R. XXX, 381\u2013386 (1981)"},{"key":"110_CR17","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s10107980009a","volume":"84","author":"Y. Nesterov","year":"1999","unstructured":"Nesterov Y., Todd M.J. and Ye Y. (1999). Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems. Math. Program. 84: 227\u2013267","journal-title":"Math. Program."},{"key":"110_CR18","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar R.T. (1970). Convex Analysis. Princeton University Press, Princeton"},{"key":"110_CR19","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Some convex programs whose duals are linearly constrained. In: Rosen, J.B. et\u00a0al (eds.) Nonlinear Programming, pp. 293-322. Academic, New York (1970)","DOI":"10.1016\/B978-0-12-597050-1.50014-2"},{"key":"110_CR20","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF00932472","volume":"7","author":"R.T. Rockafellar","year":"1971","unstructured":"Rockafellar R.T. (1971). Ordinary convex programs without a duality gap. J. Optim. Theory Appl. 7: 43\u2013148","journal-title":"J. Optim. Theory Appl."},{"key":"110_CR21","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"R.T. Rockafellar","year":"1976","unstructured":"Rockafellar R.T. (1976). Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1: 97\u2013116","journal-title":"Math. Oper. Res."},{"key":"110_CR22","unstructured":"Rockafellar, R.T.: Network Flows and Monotropic Programming. Wiley-Interscience, New York (1984); republished by Athena Scientific, Belmont (1998)"},{"key":"110_CR23","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1287\/moor.26.2.221.10557","volume":"26","author":"P. Tseng","year":"2001","unstructured":"Tseng P. (2001). An \u03b5-out-of-kilter method for monotropic programming problems. Math. Oper. Res. 26: 221\u2013233","journal-title":"Math. Oper. Res."},{"key":"110_CR24","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF00933505","volume":"40","author":"H. Wolkowicz","year":"1983","unstructured":"Wolkowicz H. (1983). Method of reduction in convex programming. J. Optim. Theory Appl. 40: 349\u2013378","journal-title":"J. Optim. Theory Appl."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-007-0110-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-007-0110-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-007-0110-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:03Z","timestamp":1559123403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-007-0110-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5,25]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["110"],"URL":"https:\/\/doi.org\/10.1007\/s10107-007-0110-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5,25]]}}}