{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T16:29:24Z","timestamp":1778516964069,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,6,20]],"date-time":"2014-06-20T00:00:00Z","timestamp":1403222400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10589-014-9667-7","type":"journal-article","created":{"date-parts":[[2014,6,19]],"date-time":"2014-06-19T08:57:22Z","timestamp":1403168242000},"page":"59-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Comparative study of RPSALG algorithm for convex semi-infinite programming"],"prefix":"10.1007","volume":"60","author":[{"given":"A.","family":"Auslender","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Ferrer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. A.","family":"Goberna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. A.","family":"L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,20]]},"reference":[{"key":"9667_CR1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1287\/moor.1080.0362","volume":"34","author":"A Auslender","year":"2009","unstructured":"Auslender, A., Goberna, M.A., L\u00f3pez, M.A.: Penalty and smoothing methods for convex semi-infinite programming. Math. Oper. Res. 34, 303\u2013319 (2009)","journal-title":"Math. Oper. Res."},{"key":"9667_CR2","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S1052623403427823","volume":"16","author":"A Auslender","year":"2006","unstructured":"Auslender, A., Teboulle, M.: Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16, 697\u2013725 (2006)","journal-title":"SIAM J. Optim."},{"key":"9667_CR3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1019204407420","volume":"98","author":"AM Bagirov","year":"2000","unstructured":"Bagirov, A.M., Rubinov, A.M.: Global minimization of increasing positively homogeneous functions over the unit simplex. Ann. Oper. Res. 98, 171\u2013187 (2000)","journal-title":"Ann. Oper. Res."},{"key":"9667_CR4","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-1-4613-0279-7_13","volume-title":"Advances in Convex Analysis and Global Optimization","author":"AM Bagirov","year":"2001","unstructured":"Bagirov, A.M., Rubinov, A.M.: Modified versions of the cutting angle method. In: Hadjisavvas, N., Pardalos, P.M. (eds.) Advances in Convex Analysis and Global Optimization, pp. 245\u2013268. Kluwer, Netherlands (2001)"},{"key":"9667_CR5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1023\/A:1020256900863","volume":"24","author":"LM Batten","year":"2002","unstructured":"Batten, L.M., Beliakov, G.: Fast algorithm for the cutting angle method of global optimization. J. Global Optim. 24, 149\u2013161 (2002)","journal-title":"J. Global Optim."},{"key":"9667_CR6","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1080\/02331930310001611556","volume":"52","author":"G Beliakov","year":"2003","unstructured":"Beliakov, G.: Geometry and combinatorics of the cutting angle method. Optimization 52, 379\u2013394 (2003)","journal-title":"Optimization"},{"key":"9667_CR7","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1080\/10556780410001647177","volume":"19","author":"G Beliakov","year":"2004","unstructured":"Beliakov, G.: Cutting angle method. A tool for constrained global optimization. Optim. Method. Softw 19, 137\u2013151 (2004)","journal-title":"Optim. Method. Softw"},{"key":"9667_CR8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/0-387-26771-9_7","volume-title":"Continuous Optimization","author":"G Beliakov","year":"2005","unstructured":"Beliakov, G.: A review of applications of the cutting angle method. In: Rubinov, A.M., Jeyakumar, V. (eds.) Continuous Optimization, pp. 209\u2013248. Springer, New York (2005)"},{"key":"9667_CR9","first-page":"153","volume":"4","author":"G Beliakov","year":"2008","unstructured":"Beliakov, G.: Extended cutting angle method of global optimization. Pacific J. Optim. 4, 153\u2013176 (2008)","journal-title":"Pacific J. Optim."},{"key":"9667_CR10","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10898-009-9467-2","volume":"47","author":"G Beliakov","year":"2010","unstructured":"Beliakov, G., Ferrer, A.: Bounded lower subdifferentiability optimization techniques: applications. J. Global Optim. 47, 211\u2013231 (2010)","journal-title":"J. Global Optim."},{"key":"9667_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1394-9","volume-title":"Perturbation Analysis of Optimization Problems","author":"JF Bonnans","year":"2000","unstructured":"Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer, New York (2000)"},{"key":"9667_CR12","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01386389","volume":"1","author":"EW Cheney","year":"1959","unstructured":"Cheney, E.W., Goldstein, A.A.: Newton method for convex programming and Tchebycheff approximation. Numer. Math. 1, 253\u2013268 (1959)","journal-title":"Numer. Math."},{"key":"9667_CR13","doi-asserted-by":"crossref","first-page":"2254","DOI":"10.1137\/090746331","volume":"20","author":"N Dinh","year":"2010","unstructured":"Dinh, N., Goberna, M.A., L\u00f3pez, M.A.: On the stability of the feasible set in optimization problems. SIAM J. Optim. 20, 2254\u20132280 (2010)","journal-title":"SIAM J. Optim."},{"key":"9667_CR14","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"9667_CR15","doi-asserted-by":"crossref","first-page":"1623","DOI":"10.1080\/00207721.2010.549582","volume":"43","author":"M Fackrell","year":"2012","unstructured":"Fackrell, M.: A semi-infinite programming approach to identifying matrix\u2013exponential distributions. Int. J. Syst. Sci. 43, 1623\u20131631 (2012)","journal-title":"Int. J. Syst. Sci."},{"key":"9667_CR16","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10589-007-9101-5","volume":"41","author":"L Faybusovich","year":"2008","unstructured":"Faybusovich, L., Mouktonglang, T., Tsuchiya, T.: Numerical experiments with universal barrier functions for cones of Chebyshev systems. Comput. Optim. Appl. 41, 205\u2013223 (2008)","journal-title":"Comput. Optim. Appl."},{"key":"9667_CR17","unstructured":"Ferrer, A., Miranda, E.: Random test examples with known minimum for convex semi-infinite programming problems. E-prints UPC, (2013) ( http:\/\/hdl.handle.net\/2117\/19118)"},{"key":"9667_CR18","volume-title":"User\u2019s guide for NPSOL: A Fortran Package for Nonliner Programing","author":"PE Gill","year":"1986","unstructured":"Gill, P.E., Murray, W., Saunders, M.A., Wright, M.H.: User\u2019s guide for NPSOL: A Fortran Package for Nonliner Programing. Stanford University, Stanford (1986)"},{"key":"9667_CR19","doi-asserted-by":"crossref","first-page":"1421","DOI":"10.1137\/080717973","volume":"20","author":"F G\u00fcrtuna","year":"2009","unstructured":"G\u00fcrtuna, F.: Duality of ellipsoidal approximations via semi-infinite programming. SIAM J. Optim. 20, 1421\u20131438 (2009)","journal-title":"SIAM J. Optim."},{"key":"9667_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex Analysis and Minimization Algorithms I. Fundamentals","author":"J-B Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms I. Fundamentals. Springer, Berlin (1993)"},{"key":"9667_CR21","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1023\/A:1019208524259","volume":"98","author":"S Ito","year":"2000","unstructured":"Ito, S., Liu, Y., Teo, K.L.: A dual parametrization method for convex semi-infinite programming. Ann. Oper. Res. 98, 189\u2013213 (2000)","journal-title":"Ann. Oper. Res."},{"key":"9667_CR22","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1109\/TSP.2008.2007095","volume":"57","author":"S Joshi","year":"2009","unstructured":"Joshi, S., Boyd, S.: Sensor selection via convex optimization. IEEE Trans. Signal Proces. 57, 451\u2013462 (2009)","journal-title":"IEEE Trans. Signal Proces."},{"key":"9667_CR23","doi-asserted-by":"crossref","first-page":"1388","DOI":"10.1016\/j.automatica.2010.05.019","volume":"46","author":"A Karimi","year":"2010","unstructured":"Karimi, A., Galdos, G.: Fixed-order $$H_{\\infty }$$ H \u221e controller design for nonparametric models by convex optimization. Automatica 46, 1388\u20131394 (2010)","journal-title":"Automatica"},{"key":"9667_CR24","first-page":"680","volume-title":"Preprints of the 16th IFAC Symposium on System Identification","author":"D Katselis","year":"2012","unstructured":"Katselis, D., Rojas, C., Welsh, J., Hjalmarsson, H.: Robust experiment design for system identification via semi-infinite programming techniques. In: Kinnaert, M. (ed.) Preprints of the 16th IFAC Symposium on System Identification, pp. 680\u2013685. Brussels, Belgium (2012)"},{"key":"9667_CR25","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"JE Kelley Jr","year":"1960","unstructured":"Kelley Jr, J.E.: The cutting-plane method for solving convex programs. J. Soc. Ind. Appl. Math. 8, 703\u2013712 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"9667_CR26","volume-title":"Elementary Functions: Algorithms and Implementation","author":"JM Muller","year":"2006","unstructured":"Muller, J.M.: Elementary Functions: Algorithms and Implementation, 2nd edn. Birkh\u00e4user, Boston (2006)","edition":"2"},{"key":"9667_CR27","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for solving the convex programming problem with convergence rate $$O(\\frac{1}{k^{2}})$$ O ( 1 k 2 ) . Soviet Math. Dokl. 27, 372\u2013376 (1983)","journal-title":"Soviet Math. Dokl."},{"key":"9667_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (1999)"},{"key":"9667_CR29","first-page":"41","volume":"10","author":"E Remez","year":"1934","unstructured":"Remez, E.: Sur la d\u00e9termination des polyn\u00f4mes d\u2019approximation de degr\u00e9 donn\u00e9. Commun. Soc. Math. Kharkoff et Inst. Sci. Math. et Mecan 10, 41\u201363 (1934)","journal-title":"Commun. Soc. Math. Kharkoff et Inst. Sci. Math. et Mecan"},{"key":"9667_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3200-9","volume-title":"Abstract Convexity and Global Optimization","author":"AM Rubinov","year":"2000","unstructured":"Rubinov, A.M.: Abstract Convexity and Global Optimization. Kluwer, Dordrecht\/Boston (2000)"},{"key":"9667_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02578932","volume":"10","author":"R Tichatschke","year":"2002","unstructured":"Tichatschke, R., Kaplan, A., Voetmann, T., B\u00f6hm, M.: Numerical treatment of an asset price model with non-stochastic uncertainty. TOP 10, 1\u201350 (2002)","journal-title":"TOP"},{"key":"9667_CR32","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/974781.974784","volume":"30","author":"A Vaz","year":"2004","unstructured":"Vaz, A., Fernandes, E., Gomes, M.: SIPAMPL: Semi-infinite programming with AMPL. ACM Trans. Math. Softw. 30, 47\u201361 (2004)","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9667-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-014-9667-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9667-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T18:12:47Z","timestamp":1565547167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-014-9667-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,20]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9667"],"URL":"https:\/\/doi.org\/10.1007\/s10589-014-9667-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,20]]}}}