An accelerating outer space algorithm for globally solving generalized linear multiplicative problems

DOI10.1007/S11075-023-01523-YMaRDI QIDQ6093979FDOQ6093979

Authors: Zhisong Hou, Sanyang Liu 

Publication date: 12 September 2023

Published in: Numerical Algorithms (Search for Journal in Brave)

Recommendations

• An out space accelerating algorithm for generalized affine multiplicative programs problem
• An efficient algorithm for globally solving generalized linear multiplicative programming
• Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
• Global algorithm for solving linear multiplicative programming problems
• Outer space branch and bound algorithm for solving linear multiplicative programming problems
• Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set
• Outcome-space outer approximation algorithm for linear multiplicative programming
• An accelerating algorithm for a class of multiplicative programming
• A full polynomial time approximation algorithm for generalized linear multiplicative problems
• An outcome-space finite algorithm for solving linear multiplicative programming

zbMATH Keywords

computational complexityglobal optimizationbranch-and-bound frameworkaccelerating outer space algorithmgeneralized linear multiplicative problems

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites Work

• Robust Optimization of Large-Scale Systems
• A tutorial on geometric programming
• A global optimization algorithm for linear fractional programming
• A new rectangle branch-and-pruning approach for generalized geometric programming
• A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions
• Global optimization of multiplicative programs
• A finite branch-and-bound algorithm for linear multiplicative programming
• Bilinear separation of two sets in \(n\)-space
• Global optimization of generalized linear fractional programming with nonlinear constraints
• Image space analysis of generalized fractional programs
• Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region
• A branch and bound algorithm for globally solving a class of nonconvex programming problems
• A branch and bound algorithm to globally solve the sum of several linear ratios
• A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
• A robust algorithm for generalized geometric programming
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
• Range division and compression algorithm for quadratically constrained sum of quadratic ratios
• A global optimization approach for solving the convex multiplicative programming problem
• Outcome-space cutting-plane algorithm for linear multiplicative programming
• Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
• Global minimization of a generalized convex multiplicative function
• Global minimization of a generalized linear multiplicative programming
• A new solution method for a class of large dimension rank-two nonconvex programs
• A nonisolated optimal solution of general linear multiplicative programming problems
• An Efficient Algorithm for Quadratic Sum-of-Ratios Fractional Programs Problem
• Range division and linearization algorithm for a class of linear ratios optimization problems
• Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
• A practical but rigorous approach to sum-of-ratios optimization in geometric applications
• Effective algorithm and computational complexity for solving sum of linear ratios problem
• On the minimization of a class of generalized linear functions on a flow polytope
• Underestimation functions for a rank-two partitioning method
• Solving generalized polynomial problem by using new affine relaxed technique
• Image space branch-reduction-bound algorithm for globally minimizing a class of multiplicative problems
• Efficient Convexification Strategy for Generalized Geometric Programming Problems
• An efficient algorithm and complexity result for solving the sum of general affine ratios problem
• An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming

Cited In (4)

• An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation
• A criterion space algorithm for solving linear multiplicative programming problems
• Outer space branch and bound algorithm for solving linear multiplicative programming problems
• An out space accelerating algorithm for generalized affine multiplicative programs problem

This page was built for publication: An accelerating outer space algorithm for globally solving generalized linear multiplicative problems

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