{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T12:54:37Z","timestamp":1770987277574,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1016\/0167-6377(96)00022-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:07:44Z","timestamp":1027588064000},"page":"117-128","source":"Crossref","is-referenced-by-count":63,"title":["Numerical solution for optimization over the efficient set by d.c. optimization algorithms"],"prefix":"10.1016","volume":"19","author":[{"given":"Le Thi Hoai","family":"An","sequence":"first","affiliation":[]},{"given":"Pham Dinh","family":"Tao","sequence":"additional","affiliation":[]},{"given":"Le Dung","family":"Muu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(96)00022-3_BIB1","article-title":"Analyse num\u00e9rique des algorithmes de l'Optimisation d.c. Approches locales et globales. Code et simulations num\u00e9riques en grande dimension. Applications","author":"An","year":"1994","journal-title":"Th\u00e8se de Doctorat de l'Universit\u00e9 de Rouen"},{"key":"10.1016\/0167-6377(96)00022-3_BIB2","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1016\/0022-247X(84)90269-5","article-title":"Optimization over the efficient set","volume":"98","author":"Benson","year":"1984","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/0167-6377(96)00022-3_BIB3","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF00120667","article-title":"An all-linear programming relaxation algorithm for optimizing over the efficient set","volume":"1","author":"Benson","year":"1991","journal-title":"J. Global Optim."},{"key":"10.1016\/0167-6377(96)00022-3_BIB4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF00940077","article-title":"A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set","volume":"73","author":"Benson","year":"1992","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/0167-6377(96)00022-3_BIB5","unstructured":"Ng. D. Dan and Le. D. Muu, \u201cA parametric simplex method for optimizing a linear function over the efficient set of a bicriteria linear program\u201d, Submitted to: Acta Math. Vietnamca."},{"key":"10.1016\/0167-6377(96)00022-3_BIB6","series-title":"Trends in Mathematical Mathematics","first-page":"55","article-title":"On locally polyhedral convex functions","author":"Durier","year":"1988"},{"key":"10.1016\/0167-6377(96)00022-3_BIB7","series-title":"Nonsmooth Optimization and Related Topics","article-title":"From convex optimization to nonconvex optimization. Part I: Necessary and sufficient conditions for global optimality","author":"Hiriart-Urruty","year":"1988"},{"key":"10.1016\/0167-6377(96)00022-3_BIB8","series-title":"Global optimization (Deterministic approaches)","author":"Horst","year":"1993"},{"key":"10.1016\/0167-6377(96)00022-3_BIB9","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1051\/m2an\/1993270303751","article-title":"Partial regularization of the sum of two maximal monotone operators","volume":"27","author":"Mahey","year":"1993","journal-title":"Math. Modell. Numer. Anal."},{"key":"10.1016\/0167-6377(96)00022-3_BIB10","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1137\/0805023","article-title":"Proximal decomposition of the graph of maximal monotone operator","volume":"5","author":"Mahey","year":"1995","journal-title":"SIAM J. Optim."},{"key":"10.1016\/0167-6377(96)00022-3_BIB11","volume":"Vol. 15","author":"Muu","year":"1991"},{"key":"10.1016\/0167-6377(96)00022-3_BIB12","article-title":"Contribution \u00e0 la th\u00e9orie de normes and ses applications \u00e0 l'analyse num\u00e9rique","author":"Tao","year":"1981"},{"key":"10.1016\/0167-6377(96)00022-3_BIB13","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0024-3795(84)90093-4","article-title":"Convergence of subgradient method for computing the bound norm of matrices","volume":"62","author":"Tao","year":"1984","journal-title":"Linear Alg. Appl."},{"key":"10.1016\/0167-6377(96)00022-3_BIB14","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF01391415","article-title":"Algorithmes de calcul du maximum d'une forme quadratique sur la boule unit\u00e9 de la norme du maximum","volume":"45","author":"Tao","year":"1985","journal-title":"Numer. Math."},{"key":"10.1016\/0167-6377(96)00022-3_BIB15","series-title":"Fermat Days 85. Mathematics for Optimization","article-title":"Algorithms for solving a class of non convex optimization problems. Methods of subgradients","author":"Tao","year":"1986"},{"key":"10.1016\/0167-6377(96)00022-3_BIB16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0012-365X(88)90083-0","article-title":"Iterative behaviour, Fixed point of a class of monotone operators. Application to non symmetric threshold function","volume":"70","author":"Tao","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/0167-6377(96)00022-3_BIB17","first-page":"276","article-title":"Duality in d.c. (difference of convex functions) optimization. Subgradient methods","volume":"Vol. 84","author":"Tao","year":"1988"},{"key":"10.1016\/0167-6377(96)00022-3_BIB18","unstructured":"P.D. Tao and L.T.H. An, \u201cD.c. (difference of convex functions) optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on euclidiean balls and spheres\u201d, to appear."},{"key":"10.1016\/0167-6377(96)00022-3_BIB19","unstructured":"P.D. Tao and L.T.H. An, \u201cA d.c. optimization algorithm for solving multidimensional scaling problem\u201d, Submitted."},{"key":"10.1016\/0167-6377(96)00022-3_BIB20","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01584543","article-title":"Algorithms for the vector maximization problem","volume":"2","author":"Philip","year":"1972","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(96)00022-3_BIB21","series-title":"Convex Analysis","author":"Rockafellar","year":"1970"},{"key":"10.1016\/0167-6377(96)00022-3_BIB22","doi-asserted-by":"crossref","first-page":"177","DOI":"10.24033\/msmf.269","article-title":"On subdifferential calculus and duality in nonconvex optimization","volume":"60","author":"Toland","year":"1979","journal-title":"Bull. Soc. Math. France, M\u00e9moire"},{"key":"10.1016\/0167-6377(96)00022-3_BIB23","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF00120663","article-title":"Effect of subdivision strategy on convergence and efficiency of some global optimization algorithms","volume":"1","author":"Tuy","year":"1991","journal-title":"J. Global Optim."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637796000223?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637796000223?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T17:27:56Z","timestamp":1556558876000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637796000223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0167637796000223"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(96)00022-3","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}