GLOBALLib

swMATH4653MaRDI QIDQ16823

No author found.

Related Items (32)

New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming ⋮ A successive linear approximation algorithm for the global minimization of a concave quadratic program ⋮ A hybrid LP/NLP paradigm for global optimization relaxations ⋮ Global optimization with spline constraints: a new branch-and-bound method based on B-splines ⋮ A conversion of an SDP having free variables into the standard form SDP ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ Partitioning procedure for polynomial optimization ⋮ Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations ⋮ Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 ⋮ A framework for globally optimizing mixed-integer signomial programs ⋮ Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm ⋮ Outer-product-free sets for polynomial optimization and oracle-based cuts ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Benchmarking nonlinear optimization software in technical computing environments ⋮ Global optimization for generalized linear multiplicative programming using convex relaxation ⋮ Reformulations in mathematical programming: automatic symmetry detection and exploitation ⋮ Stabilizer-based symmetry breaking constraints for mathematical programs ⋮ Nonlinear optimization with GAMS /LGO ⋮ PAVER 2.0: an open source environment for automated performance analysis of benchmarking data ⋮ ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations ⋮ Globally solving nonconvex quadratic programming problems via completely positive programming ⋮ Global optimization of general non-convex problems with intermediate bilinear substructures ⋮ Tuning BARON using derivative-free optimization algorithms ⋮ A scalable global optimization algorithm for stochastic nonlinear programs ⋮ A comparison of complete global optimization solvers ⋮ Convex relaxations for mixed-integer nonlinear programs ⋮ Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems ⋮ Recognizing underlying sparsity in optimization ⋮ Global Optimization and Constraint Satisfaction ⋮ Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP ⋮ Fast construction of constant bound functions for sparse polynomials ⋮ A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems

This page was built for software: GLOBALLib