Alternative branching rules for some nonconvex problems
From MaRDI portal
Publication:2943824
DOI10.1080/10556788.2014.885521zbMath1326.90066OpenAlexW1974027612MaRDI QIDQ2943824
Publication date: 4 September 2015
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2014.885521
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Fractional programming (90C32)
Related Items
Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, (Global) optimization: historical notes and recent developments, Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems, Efficient local search procedures for quadratic fractional programming problems, Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
Uses Software
Cites Work
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- An analytical approach to global optimization
- Calculation of bounds on variables satisfying nonlinear inequality constraints
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- Global minimization of a generalized convex multiplicative function
- A convex envelope formula for multilinear functions
- A polyhedral branch-and-cut approach to global optimization
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A branch-and-reduce approach to global optimization
- BARON: A general purpose global optimization software package
- Global optimization problems and domain reduction strategies
- On convex envelopes for bivariate functions over polytopes
- Solving sum of ratios fractional programs via concave minimization
- Fractional programming: The sum-of-ratios case
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- Semidefinite relaxations of fractional programs via novel convexification techniques
