Alternative branching rules for some nonconvex problems

DOI10.1080/10556788.2014.885521MaRDI QIDQ2943824zbMATH OpenOpenAlexFDO

Authors Marco Locatelli

Publication date 4 September 2015

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2014.885521

zbMATH Keywords

envelopesbranch-and-boundbranching rulessum of affine ratiossum of affine products

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Fractional programming (90C32) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• On branching rules for convex mixed-integer nonlinear optimization
• Branching rules revisited
• A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
• scientific article; zbMATH DE number 2153021
• scientific article; zbMATH DE number 903760

Cites work

• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
• A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
• A branch-and-bound algorithm for maximizing the sum of several linear ratios
• A branch-and-reduce approach to global optimization
• 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
• An analytical approach to global optimization
• BARON: A general purpose global optimization software package
• Calculation of bounds on variables satisfying nonlinear inequality constraints
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Fractional programming: The sum-of-ratios case
• Global minimization of a generalized convex multiplicative function
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• Global optimization problems and domain reduction strategies
• Jointly Constrained Biconvex Programming
• On convex envelopes for bivariate functions over polytopes
• Semidefinite relaxations of fractional programs via novel convexification techniques
• Solving sum of ratios fractional programs via concave minimization

Cited in

(6)

• Efficient local search procedures for quadratic fractional programming problems
• Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• Branching of solutions of linear time-optimal problem at an irregular point
• (Global) optimization: historical notes and recent developments
• Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes

Describes a project that uses

Uses Software

• BARON

This page was built for publication: Alternative branching rules for some nonconvex problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943824)