Monotonic Optimization: Branch and Cut Methods

DOI10.1007/0-387-25570-2_2MaRDI QIDQ5421799zbMATH OpenOpenAlexFDO

Authors Hoang Tuy, Phan Thien Thach, Faiz Al-Khayyal

Publication date 24 October 2007

Published in Essays and Surveys in Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/0-387-25570-2_2

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Monotonic optimization: Problems and solution approaches
• A branch-and-bound based method for solving monotone optimization problems
• A new approach to optimization under monotonic constraint
• Monotonization in global optimization
• Convexification and monotone optimization

Cited in

(20)

• A nonisolated optimal solution of general linear multiplicative programming problems
• Solving sum of quadratic ratios fractional programs via monotonic function
• Normal sets, polyblocks, and monotonic optimization
• Global minimization for generalized polynomial fractional program
• A robust algorithm for quadratic optimization under quadratic constraints
• On a decomposition method for nonconvex global optimization
• A novel approach to bilevel nonlinear programming
• A branch-and-bound based method for solving monotone optimization problems
• A nonisolated optimal solution for special reverse convex programming problems
• Monotonic optimization: Problems and solution approaches
• scientific article; zbMATH DE number 7033214 (Why is no real title available?)
• Matrix-Monotonic Optimization - Part I: Single-Variable Optimization
• Computational Science and Its Applications – ICCSA 2004
• Discrete Monotonic Optimization with Application to a Discrete Location Problem
• Non-convex optimization problems with linear KKT subsystem
• Algorithms for projecting a point onto a level surface of a continuous function on a compact set
• A robust algorithm for generalized geometric programming
• A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
• Nonconcave utility maximisation in the MIMO broadcast channel
• \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization

Describes a project that uses

Uses Software

• MINOS

This page was built for publication: Monotonic Optimization: Branch and Cut Methods

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