{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:46:44Z","timestamp":1751366804223},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"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":[[1992,8]]},"DOI":"10.1007\/bf01580901","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:58:11Z","timestamp":1114678691000},"page":"233-243","source":"Crossref","is-referenced-by-count":16,"title":["\u03b5-optimality criteria for convex programming problems via exact penalty functions"],"prefix":"10.1007","volume":"56","author":[{"given":"Kazunori","family":"Yokoyama","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01681332","volume":"9","author":"D.P. Bertsekas","year":"1975","unstructured":"D.P. Bertsekas, \u201cNecessary and sufficient conditions for a penalty method to be exact,\u201dMathematical Programming 9 (1975) 87\u201399.","journal-title":"Mathematical Programming"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01588250","volume":"17","author":"S.-P. Han","year":"1979","unstructured":"S.-P. Han and O.L. Mangasarian, \u201cExact penalty functions in nonlinear programming,\u201dMathematical Programming 17 (1979) 251\u2013269.","journal-title":"Mathematical Programming"},{"key":"CR3","first-page":"43","volume-title":"Convex Analysis and Optimization. Research Notes in Mathematics Series No. 57","author":"J.-B. Hiriart Urruty","year":"1982","unstructured":"J.-B. Hiriart Urruty, \u201c\u03b5-Subdifferential calculus,\u201d in: J.-P. Aubin and R.B. Vinter, eds.,Convex Analysis and Optimization. Research Notes in Mathematics Series No. 57 (Pitman, Boston, MA, 1982) pp. 43\u201392."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/BFb0120986","volume":"19","author":"P. Loridan","year":"1982","unstructured":"P. Loridan, \u201cNecessary conditions for\u03b5-optimality,\u201dMathematical Programming Study 19 (1982) 140\u2013152.","journal-title":"Mathematical Programming Study"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF02592056","volume":"26","author":"P. Loridan","year":"1983","unstructured":"P. Loridan and J. Morgan, \u201cPenalty functions in\u03b5-programming and\u03b5-minimax problems,\u201dMathematical Programming 26 (1983) 213\u2013231.","journal-title":"Mathematical Programming"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/0323003","volume":"23","author":"O.L. Mangasarian","year":"1985","unstructured":"O.L. Mangasarian, \u201cSufficiency of exact penalty minimization,\u201dSIAM Journal on Control and Optimization 23 (1985) 30\u201337.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR7","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":"CR8","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/BF02591938","volume":"30","author":"E. Rosenberg","year":"1984","unstructured":"E. Rosenberg, \u201cExact penalty functions and stability in locally Lipschitz programming,\u201dMathematical Programming 30 (1984) 340\u2013356.","journal-title":"Mathematical Programming"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02594782","volume":"25","author":"J.J. Strodiot","year":"1983","unstructured":"J.J. Strodiot, V.H. Nguyen and N. Heukemes, \u201c\u03b5-Optimal solutions in nondifferentiable convex programming and some related questions,\u201dMathematical Programming 25 (1983) 307\u2013328.","journal-title":"Mathematical Programming"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/mnsc.13.5.344","volume":"13","author":"W.I. Zangwill","year":"1967","unstructured":"W.I. Zangwill, \u201cNonlinear programming via penalty functions,\u201dManagement Science 13 (1967) 344\u2013358.","journal-title":"Management Science"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580901.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580901\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580901","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:12Z","timestamp":1556896332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580901"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":10,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["BF01580901"],"URL":"https:\/\/doi.org\/10.1007\/bf01580901","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}