Fetching the paper…
Reading the bibliography…
Conic optimization has recently emerged as a powerful tool for designing tractable and guaranteed algorithms for non-convex polynomial optimization problems.
An approach to obtaining global extremums in polynomial mathematical programming problems
Shor, N. Z. (1987) · 1987
Earlier work this paper cites.
A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
Sherali, H. D. and Tuncbilek, C. H. (1992) · 1992
Earlier work this paper cites.
The Mosek Interior Point Optimizer for Linear Programming: An Implementation of the Homogeneous Algorithm
Andersen, E. D. and Andersen, K. D. (2000) · 2000
Earlier work this paper cites.
Random forests
Breiman, L. (2001) · 2001
Earlier work this paper cites.
Global optimization with polynomials and the problem of moments
Lasserre, J. B. (2001) · 2001
Earlier work this paper cites.
Benchmarking optimization software with performance profiles
Dolan, E. D. and Moré, J. J. (2002) · 2002
Earlier work this paper cites.
MINLPLib-a collection of test models for mixed-integer nonlinear programming
Bussieck, M. R., Drud, A. S., and Meeraus, A. (2003) · 2003
Earlier work this paper cites.
Semidefinite programming relaxations for semialgebraic problems
Parrilo, P. A. (2003) · 2003
Earlier work this paper cites.
Quantile regression forests
Meinshausen, N. (2006) · 2006
Earlier work this paper cites.
An efficient heuristic procedure for the optimal design of wastewater treatment systems
Castro, P. M., Matos, H. A., and Novais, A. Q. (2007) · 2007
Earlier work this paper cites.
A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
Burer, S. and Vandenbussche, D. (2008) · 2008
Earlier work this paper cites.
Branching and bounds tightening techniques for non-convex MINLP
Belotti, P., Lee, J., Liberti, L., Margot, F., and Wächter, A. (2009) · 2009
Earlier work this paper cites.
Linear program-based algorithm for the optimal design of wastewater treatment systems
Castro, P. M., Teles, J. P., and Novais, A. Q. (2009) · 2009
Earlier work this paper cites.
Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations
Rendl, F., Rinaldi, G., and Wiegele, A. (2010) · 2010
Cited alongside, same era.
Enhancing RLT-based relaxations for polynomial programming problems via a new class of v v -semidefinite cuts
Sherali, H. D., Dalkiran, E., and Desai, J. (2012) · 2012
Cited alongside, same era.
Global optimization of water networks design using multiparametric disaggregation
Teles, J. P., Castro, P. M., and Matos, H. A. (2012) · 2012
Cited alongside, same era.
Semidefinite relaxations for non-convex quadratic mixed-integer programming
Buchheim, C. and Wiegele, A. (2013) · 2013
Cited alongside, same era.
Comparison of global optimization algorithms for the design of water-using networks
Castro, P. M. and Teles, J. P. (2013) · 2013
Cited alongside, same era.
Global solution of non-convex quadratically constrained quadratic programs
Elloumi, S. and Lambert, A. (2019) · 2019
Later among the works it cites.
Power transmission network expansion planning: A semidefinite programming branch-and-bound approach
Ghaddar, B. and Jabr, R. A. (2019) · 2019
Later among the works it cites.
Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
Burer, S. and Ye, Y. (2020) · 2020
Later among the works it cites.
Computational advances in polynomial optimization: RAPOSa, a freely available global solver
González-Rodríguez, B., Ossorio-Castillo, J., González-Díaz, J., González-Rueda, Á. M., Penas, D. R., and Rodríguez-Martínez, D. (2020) · 2020
Later among the works it cites.
Machine learning for combinatorial optimization: a methodological tour d’horizon
Bengio, Y., Lodi, A., and Prouvost, A. (2021) · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Dalkiran, E. and Sherali, H. D. (2013) · 2013
Cited alongside, same era.
RLT-POS: Reformulation-linearization technique-based optimization software for solving polynomial programming problems
Dalkiran, E. and Sherali, H. D. (2016) · 2016
Cited alongside, same era.
Biqcrunch: A semidefinite branch-and-bound method for solving binary quadratic problems
Krislock, N., Malick, J., and Roupin, F. (2017) · 2017
Cited alongside, same era.
On learning and branching: a survey
Lodi, A. and Zarpellon, G. (2017) · 2017
Cited alongside, same era.
ranger: A fast implementation of random forests for high dimensional data in C++ and R
Wright, M. N. and Ziegler, A. (2017) · 2017
Cited alongside, same era.
QPLIB: a library of quadratic programming instances
Furini, F., Traversi, E., Belotti, P., Frangioni, A., Gleixner, A., Gould, N., Liberti, L., Lodi, A., Misener, R., Mittelmann, H., Sahinidis, N., Vigerske, S., and Wiegele, A. (2018) · 2018
Cited alongside, same era.
Scoring positive semidefinite cutting planes for quadratic optimization via trained neural networks
Baltean-Lugojan, R., Bonami, P., Misener, R., and Tramontani, A. (2019) · 2019
Cited alongside, same era.
R: A Language and Environment for Statistical Computing
R Core Team (2021) · 2021
Later among the works it cites.
FICO Xpress Optimization Suite
FICO (2022) · 2022
Closest in time.
Learning for spatial branching: An algorithm selection approach
Ghaddar, B., Gómez-Casares, I., González-Díaz, J., González-Rodríguez, B., Pateiro-López, B., and Rodríguez-Ballesteros, S. (2022) · 2022
Closest in time.
Gurobi Optimizer Reference Manual
Gurobi Optimization (2022) · 2022
Closest in time.
IBM ILOG CPLEX Optimization Studio. CPLEX User’s Manual
IBM Corp. (2022) · 2022
Closest in time.
Introducing the MOSEK Optimization Suite 9.3.20
MOSEK ApS (2022) · 2022
Closest in time.
Sos-sdp: an exact solver for minimum sum-of-squares clustering
Piccialli, V., Sudoso, A. M., and Wiegele, A. (2022) · 2022
Closest in time.