LINDOGlobal

swMATH6196MaRDI QIDQ18330FDOQ18330

Author name not available (Why is that?)

Described by source

• The global solver in the LINDO API

Cited In (55)

• Convergent upper bounds in global minimization with nonlinear equality constraints
• Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach
• Mixed integer nonlinear programming tools: a practical overview
• QPLIB: a library of quadratic programming instances
• Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
• A note on solving DiDi's driver-order matching problem
• Extending a CIP Framework to Solve MIQCPs
• Tighter McCormick relaxations through subgradient propagation
• Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
• Global optimization of nonconvex problems with multilinear intermediates
• Global optimization of nonconvex problems with convex-transformable intermediates
• A global MINLP approach to symbolic regression
• Global optimization with spline constraints: a new branch-and-bound method based on B-splines
• Linear transformation based solution methods for non-convex mixed integer quadratic programs
• The supporting hyperplane optimization toolkit for convex MINLP
• Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
• Packing ellipsoids by nonlinear optimization
• Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• Scheduling with compressible and stochastic release dates
• Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes
• A framework for globally optimizing mixed-integer signomial programs
• A computational study of global optimization solvers on two trust region subproblems
• Global optimization of general non-convex problems with intermediate bilinear substructures
• GLOMIQO: global mixed-integer quadratic optimizer
• Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
• RENS. The optimal rounding
• On the impact of running intersection inequalities for globally solving polynomial optimization problems
• Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
• Guided dive for the spatial branch-and-bound
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• A note on convex reformulation schemes for mixed integer quadratic programs
• A hybrid LP/NLP paradigm for global optimization relaxations
• Deterministic global optimization in ab-initio quantum chemistry
• Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
• Optimization hierarchy for fair statistical decision problems
• Modelling counter-intuitive effects on cost and air pollution from intermittent generation
• Towards globally optimal operation of water supply networks
• The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
• Data-driven stochastic optimization for distributional ambiguity with integrated confidence region
• Domain reduction techniques for global NLP and MINLP optimization
• Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
• An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
• Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment
• Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems
• Data-driven modeling of \(\mathrm{CO}_2\) emission-allowance compensation for wood-purchasing optimization toward carbon-neutral forest industry
• Analyzing the computational impact of MIQCP solver components
• Decomposition-based inner- and outer-refinement algorithms for global optimization
• Global optimization of general nonconvex problems with intermediate polynomial substructures
• Bound reduction using pairs of linear inequalities
• Derivative-free optimization: a review of algorithms and comparison of software implementations
• Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
• Differentiable McCormick relaxations
• Undercover: a primal MINLP heuristic exploring a largest sub-MIP
• COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS

This page was built for software: LINDOGlobal