{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T13:49:39Z","timestamp":1772891379945,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,3,4]],"date-time":"2015-03-04T00:00:00Z","timestamp":1425427200000},"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":["Math. Program."],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s10107-015-0870-9","type":"journal-article","created":{"date-parts":[[2015,3,3]],"date-time":"2015-03-03T02:28:20Z","timestamp":1425349700000},"page":"21-57","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A dynamic inequality generation scheme for polynomial programming"],"prefix":"10.1007","volume":"156","author":[{"given":"Bissan","family":"Ghaddar","sequence":"first","affiliation":[]},{"given":"Juan C.","family":"Vera","sequence":"additional","affiliation":[]},{"given":"Miguel F.","family":"Anjos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,4]]},"reference":[{"key":"870_CR1","doi-asserted-by":"crossref","unstructured":"Anjos, M., Lasserre, J. (eds.): Handbook on Semidefinite, Conic and Polynomial Optimization. International Series in Operations Research and Management Science. Springer, Berlin (2012)","DOI":"10.1007\/978-1-4614-0769-0"},{"issue":"3","key":"870_CR2","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s11081-008-9050-6","volume":"10","author":"Y Bai","year":"2009","unstructured":"Bai, Y., de Klerk, E., Pasechnik, D., Sotirov, R.: Exploiting group symmetry in truss topology optimization. Optim. Eng. 10(3), 331\u2013349 (2009)","journal-title":"Optim. Eng."},{"key":"870_CR3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math. Program. 58, 295\u2013324 (1993)","journal-title":"Math. Program."},{"key":"870_CR4","doi-asserted-by":"crossref","first-page":"3035","DOI":"10.1090\/S0002-9939-06-08249-9","volume":"134","author":"C Bayer","year":"2006","unstructured":"Bayer, C., Teichmann, J.: The proof of Tchakaloff\u2019s theorem. Proc. Am. Math. Soc. 134, 3035\u20133040 (2006)","journal-title":"Proc. Am. Math. Soc."},{"issue":"1","key":"870_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.01.025","volume":"201","author":"E Klerk de","year":"2010","unstructured":"de Klerk, E.: Exploiting special structure in semidefinite programming: a survey of theory and applications. Eur. J. Oper. Res. 201(1), 1\u201310 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"870_CR6","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/S1052623401383248","volume":"12","author":"E Klerk de","year":"2002","unstructured":"de Klerk, E., Pasechnik, D.: Approximation of the stability number of a graph via copositive programming. SIAM J. Optim. 12(4), 875\u2013892 (2002)","journal-title":"SIAM J. Optim."},{"issue":"2\u20133","key":"870_CR7","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/s10107-006-0039-7","volume":"109","author":"E Klerk de","year":"2007","unstructured":"de Klerk, E., Pasechnik, D., Schrijver, A.: Reduction of symmetric semidefinite programs using the regular $$^*$$ \u2217 -representation. Math. Program. 109(2\u20133), 613\u2013624 (2007)","journal-title":"Math. Program."},{"issue":"2","key":"870_CR8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-008-0246-5","volume":"122","author":"E Klerk de","year":"2010","unstructured":"de Klerk, E., Sotirov, R.: Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem. Math. Program. 122(2), 225\u2013246 (2010)","journal-title":"Math. Program."},{"issue":"2","key":"870_CR9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0377-0427(94)90020-5","volume":"55","author":"M Deza","year":"1994","unstructured":"Deza, M., Laurent, M.: Applications of cut polyhedra-I. J. Comput. Appl. Math. 55(2), 191\u2013216 (1994)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"870_CR10","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0377-0427(94)90021-3","volume":"55","author":"M Deza","year":"1994","unstructured":"Deza, M., Laurent, M.: Applications of cut polyhedra-II. J. Comput. Appl. Math. 55(2), 217\u2013247 (1994)","journal-title":"J. Comput. Appl. Math."},{"issue":"1\u20133","key":"870_CR11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.jpaa.2003.12.011","volume":"192","author":"K Gatermann","year":"2004","unstructured":"Gatermann, K., Parrilo, P.: Symmetry groups, semidefinite programs, and sums of squares. J. Pure Appl. Algebra 192(1\u20133), 95\u2013128 (2004)","journal-title":"J. Pure Appl. Algebra"},{"key":"870_CR12","unstructured":"Ghaddar, B.: New conic optimization techniques for solving binary polynomial programming problems. PhD thesis, University of Waterloo, 2011. http:\/\/uwspace.uwaterloo.ca\/bitstream\/10012\/6139\/1\/Ghaddar_Bissan.pdf"},{"issue":"1","key":"870_CR13","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1137\/100802190","volume":"21","author":"B Ghaddar","year":"2011","unstructured":"Ghaddar, B., Vera, J.C., Anjos, M.F.: Second-order cone relaxations for binary quadratic polynomial programs. SIAM J. Optim. 21(1), 391\u2013414 (2011)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"870_CR14","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10107-008-0210-4","volume":"9","author":"S Kim","year":"2009","unstructured":"Kim, S., Kojima, M., Toint, P.: Recognizing underlying sparsity in optimization. Math. Program. 9(2), 273\u2013303 (2009)","journal-title":"Math. Program."},{"issue":"3","key":"870_CR15","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1137\/S1052623400380079","volume":"12","author":"J Lasserre","year":"2001","unstructured":"Lasserre, J.: An explicit equivalent positive semidefinite program for nonlinear 0\u20131 programs. SIAM J. Optim. 12(3), 756\u2013769 (2001)","journal-title":"SIAM J. Optim."},{"key":"870_CR16","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J Lasserre","year":"2001","unstructured":"Lasserre, J.: Global optimization problems with polynomials and the problem of moments. SIAM J. Optim. 11, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"870_CR17","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/moor.27.2.347.322","volume":"27","author":"J Lasserre","year":"2002","unstructured":"Lasserre, J.: Semidefinite programming versus LP relaxations for polynomial programming. Math. Oper. Res. 27(2), 347\u2013360 (2002)","journal-title":"Math. Oper. Res."},{"key":"870_CR18","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"M Laurent","year":"2001","unstructured":"Laurent, M.: A comparison of the sherali-adams, lov\u00e1sz-schrijver and lasserre relaxations for 0\u20131 programming. Math. Oper. Res. 28, 470\u2013496 (2001)","journal-title":"Math. Oper. Res."},{"key":"870_CR19","doi-asserted-by":"crossref","unstructured":"Laurent, M.: Semidefinite representations for finite varieties. Math. Program. 109(Ser. A), 1\u201326 (2007)","DOI":"10.1007\/s10107-004-0561-4"},{"key":"870_CR20","doi-asserted-by":"crossref","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. (eds.) Emerging Applications of Algebraic Geometry, volume 149 of The IMA Volumes in Mathematics and its Applications, vol. 149, pp. 157\u2013270. Springer, Berlin (2009)","DOI":"10.1007\/978-0-387-09686-5_7"},{"key":"870_CR21","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1, 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"870_CR22","unstructured":"Nesterov, Y.: Structure of non-negative polynomials and optimization problems. Technical report, Technical Report 9749, CORE, (1997)"},{"issue":"4","key":"870_CR23","doi-asserted-by":"crossref","first-page":"1534","DOI":"10.1137\/060668791","volume":"19","author":"J Nie","year":"2008","unstructured":"Nie, J., Demmel, J.: Sparse SOS relaxations for minimizing functions that are summation of small polynomials. SIAM J. Optim. 19(4), 1534\u20131558 (2008)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"870_CR24","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10107-005-0672-6","volume":"106","author":"J Nie","year":"2006","unstructured":"Nie, J., Demmel, J., Sturmfels, B.: Minimizing polynomials via sum of squares over the gradient ideal. Math. Program. Ser. A B 106(3), 587\u2013606 (2006)","journal-title":"Math. Program. Ser. A B"},{"key":"870_CR25","unstructured":"Parrilo, P.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD thesis, Department of Control and Dynamical Systems, California Institute of Technology, Pasadena, California, (2000)"},{"key":"870_CR26","unstructured":"Parrilo, P.: An explicit construction of distinguished representations of polynomials nonnegative over finite sets. Technical report, IFA Technical Report AUT02-02, Zurich-Switzerland, (2002)"},{"issue":"2","key":"870_CR27","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"P Parrilo","year":"2003","unstructured":"Parrilo, P.: Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96(2), 293\u2013320 (2003)","journal-title":"Math. Program."},{"key":"870_CR28","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1090\/dimacs\/060\/08","volume":"60","author":"P Parrilo","year":"2003","unstructured":"Parrilo, P., Sturmfels, B.: Minimizing polynomial functions, algorithmic and quantitative real algebraic geometry. DIMACS Ser. Discrete Math. Theor. Comput. Sci. 60, 83\u201389 (2003)","journal-title":"DIMACS Ser. Discrete Math. Theor. Comput. Sci."},{"issue":"1","key":"870_CR29","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/05064401X","volume":"18","author":"J Pe\u00f1a","year":"2007","unstructured":"Pe\u00f1a, J., Vera, J.C., Zuluaga, L.: Computing the stability number of a graph via linear and semidefinite programming. SIAM J. Optim. 18(1), 87\u2013105 (2007)","journal-title":"SIAM J. Optim."},{"key":"870_CR30","doi-asserted-by":"crossref","unstructured":"Pe\u00f1a, J. F., Vera, J. C., Zuluaga, L. F.: Exploiting equalities in polynomial programming. Oper. Res. Lett. 36(2), 223\u2013228 (2008)","DOI":"10.1016\/j.orl.2007.05.011"},{"issue":"5","key":"870_CR31","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.dam.2006.08.007","volume":"155","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D.: The quadratic knapsack problem-a survey. Discrete App. Math. 155(5), 623\u2013648 (2007)","journal-title":"Discrete App. Math."},{"key":"870_CR32","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1137\/S003614450444614X","volume":"49","author":"I P\u00f3lik","year":"2007","unstructured":"P\u00f3lik, I., Terlaky, T.: A survey of the $$\\cal {S}$$ S -lemma. SIAM Rev. 49, 371\u2013418 (2007)","journal-title":"SIAM Rev."},{"key":"870_CR33","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1512\/iumj.1993.42.42045","volume":"42","author":"M Putinar","year":"1993","unstructured":"Putinar, M.: Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J. 42, 969\u2013984 (1993)","journal-title":"Indiana Univ. Math. J."},{"issue":"3","key":"870_CR34","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3), 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"870_CR35","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1023\/A:1008237515535","volume":"10","author":"HD Sherali","year":"1997","unstructured":"Sherali, H.D., Tuncbilek, C.H.: Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems. J. Glob. Optim. 10(4), 381\u2013390 (1997)","journal-title":"J. Glob. Optim."},{"issue":"6","key":"870_CR36","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1007\/BF01070233","volume":"23","author":"N Shor","year":"1987","unstructured":"Shor, N.: A class of global minimum bounds of polynomial functions. Cybernetics 23(6), 731\u2013734 (1987)","journal-title":"Cybernetics"},{"key":"870_CR37","first-page":"123","volume":"81","author":"V Tchakaloff","year":"1957","unstructured":"Tchakaloff, V.: Formules de cubature m\u00e9canique \u00e0 coefficients non n\u00e9gatifs. Bull. Sci. Math. 81, 123\u2013134 (1957)","journal-title":"Bull. Sci. Math."},{"key":"870_CR38","doi-asserted-by":"crossref","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L.: Handbook of Semidefinite programming-Theory, Algorithms, and Applications. Kluwer, Dordrecht (2000)","DOI":"10.1007\/978-1-4615-4381-7"},{"key":"870_CR39","doi-asserted-by":"crossref","unstructured":"Zuluaga, L., Vera, J. C., Pe\u00f1a, J.: LMI approximations for cones of positive semidefinite forms. SIAM J. Optim. 16(4), 1076\u20131091 (2006)","DOI":"10.1137\/03060151X"},{"key":"870_CR40","unstructured":"Zuluaga, L. F.: A conic programming approach to polynomial optimization problems: theory and applications. PhD thesis, The Tepper School of Business, Carnegie Mellon University, Pittsburgh, (2004)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0870-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0870-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0870-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T10:21:45Z","timestamp":1566382905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0870-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,4]]},"references-count":40,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["870"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0870-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,4]]}}}