GLOBALLib

swMATH4653MaRDI QIDQ16823FDOQ16823

Author name not available (Why is that?)

Cited In (32)

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

This page was built for software: GLOBALLib