Pages that link to "Item:Q1383840"
From MaRDI portal
The following pages link to A finite algorithm for global minimization of separable concave programs (Q1383840):
Displaying 31 items.
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- Computing the lowest equilibrium pose of a cable-suspended rigid body (Q402228) (← links)
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience (Q613323) (← links)
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
- A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization (Q656831) (← links)
- A branch and reduce approach for solving a class of low rank d.c. programs (Q732158) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications (Q1112727) (← links)
- A finite concave minimization algorithm using branch and bound and neighbor generation (Q1330802) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (Q1704912) (← links)
- Rounding-based heuristics for nonconvex MINLPS (Q1762458) (← links)
- Nonconvex optimization over a polytope using generalized capacity improvement (Q1904646) (← links)
- BARON: A general purpose global optimization software package (Q1924072) (← links)
- Tighter McCormick relaxations through subgradient propagation (Q2010084) (← links)
- A geometric branch and bound method for robust maximization of convex functions (Q2052396) (← links)
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems (Q2182853) (← links)
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods (Q2219510) (← links)
- Tuning BARON using derivative-free optimization algorithms (Q2274849) (← links)
- Strong formulations for the pooling problem (Q2392127) (← links)
- Global optimization in stabilizing controller design (Q2465481) (← links)
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems (Q2569195) (← links)
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints (Q2576448) (← links)
- Presolve Reductions in Mixed Integer Programming (Q3386778) (← links)
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (Q4637830) (← links)
- Variable Bound Tightening and Valid Constraints for Multiperiod Blending (Q5106407) (← links)
- Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models (Q5131703) (← links)
- Mathematical programming formulations for the alternating current optimal power flow problem (Q5918268) (← links)
- Mathematical programming formulations for the alternating current optimal power flow problem (Q5918757) (← links)
- Preface (Q5970730) (← links)
