A finite algorithm for global minimization of separable concave programs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 970356
- Finite algorithms for global minimization of separable concave programs
- A finite algorithm for concave minimization over a polyhedron
- scientific article; zbMATH DE number 2146951
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
Cited in
(37)- Global optimization in stabilizing controller design
- Computing the lowest equilibrium pose of a cable-suspended rigid body
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods
- Tighter McCormick relaxations through subgradient propagation
- Variable Bound Tightening and Valid Constraints for Multiperiod Blending
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- A review of recent advances in global optimization
- A branch and reduce approach for solving a class of low rank d.c. programs
- Nonconvex optimization over a polytope using generalized capacity improvement
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- scientific article; zbMATH DE number 2146951 (Why is no real title available?)
- Preface
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience
- A geometric branch and bound method for robust maximization of convex functions
- Presolve Reductions in Mixed Integer Programming
- A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization
- Tuning BARON using derivative-free optimization algorithms
- Global optimization from concave minimization to concave mixed variational inequality
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Finite algorithms for global minimization of separable concave programs
- Mathematical programming formulations for the alternating current optimal power flow problem
- Mathematical programming formulations for the alternating current optimal power flow problem
- A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope
- Rounding-based heuristics for nonconvex MINLPS
- Sufficient conditions for solving linearly constrained separable concave global minimization problems
- Strong formulations for the pooling problem
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Domain reduction techniques for global NLP and MINLP optimization
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
- BARON: A general purpose global optimization software package
- Deletion presolve for accelerating infeasibility diagnosis in optimization models
- Linear programs with an additional separable concave constraint
- A finite concave minimization algorithm using branch and bound and neighbor generation
This page was built for publication: A finite algorithm for global minimization of separable concave programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383840)
