A finite algorithm for global minimization of separable concave programs
From MaRDI portal
Publication:1383840
DOI10.1023/A:1008241411395zbMath0906.90159MaRDI QIDQ1383840
Nikolaos V. Sahinidis, J. Parker Shectman
Publication date: 4 August 1998
Published in: Journal of Global Optimization (Search for Journal in Brave)
Related Items
A review of recent advances in global optimization, Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects, Nonconvex optimization over a polytope using generalized capacity improvement, Strong formulations for the pooling problem, BARON: A general purpose global optimization software package, Optimality-based domain reduction for inequality-constrained NLP and MINLP problems, Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience, Computing the lowest equilibrium pose of a cable-suspended rigid body, Variable Bound Tightening and Valid Constraints for Multiperiod Blending, Domain reduction techniques for global NLP and MINLP optimization, An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver, On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope, Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models, Two-row and two-column mixed-integer presolve using hashing-based pairing methods, A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, Global optimization in stabilizing controller design, Bounds tightening based on optimality conditions for nonconvex box-constrained optimization, Rounding-based heuristics for nonconvex MINLPS, Tighter McCormick relaxations through subgradient propagation, Tuning BARON using derivative-free optimization algorithms, A branch and reduce approach for solving a class of low rank d.c. programs, Mathematical programming formulations for the alternating current optimal power flow problem, Mathematical programming formulations for the alternating current optimal power flow problem, Preface, A geometric branch and bound method for robust maximization of convex functions, Presolve Reductions in Mixed Integer Programming, Sufficient optimality criterion for linearly constrained, separable concave minimization problems, Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
Uses Software
