The following pages link to GLOBALLib (Q16823):
Displaying 28 items.
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- Stabilizer-based symmetry breaking constraints for mathematical programs (Q486387) (← links)
- Partitioning procedure for polynomial optimization (Q604960) (← links)
- Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm (Q625645) (← links)
- Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305) (← links)
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems (Q813367) (← links)
- A successive linear approximation algorithm for the global minimization of a concave quadratic program (Q827382) (← links)
- Recognizing underlying sparsity in optimization (Q1013977) (← links)
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (Q1024721) (← links)
- Fast construction of constant bound functions for sparse polynomials (Q1029674) (← links)
- A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616) (← links)
- Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
- A comparison of complete global optimization solvers (Q1780958) (← links)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- Benchmarking nonlinear optimization software in technical computing environments (Q1948530) (← links)
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming (Q2124794) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data (Q2250081) (← links)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
- Tuning BARON using derivative-free optimization algorithms (Q2274849) (← links)
- A scalable global optimization algorithm for stochastic nonlinear programs (Q2274886) (← links)
- Nonlinear optimization with GAMS /LGO (Q2460112) (← links)
- A conversion of an SDP having free variables into the standard form SDP (Q2643612) (← links)
- Convex relaxations for mixed-integer nonlinear programs (Q4605948) (← links)
