Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems

DOI10.1016/j.cam.2022.114784zbMath1502.90136OpenAlexW4293832943WikidataQ114201637 ScholiaQ114201637MaRDI QIDQ2088876

Wenjie Wang, You-lin Shang, Hong-Wei Jiao

Publication date: 6 October 2022

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2022.114784

zbMATH Keywords

computational complexityglobal optimizationaffine relaxationgeneralized affine multiplicative problemouter space region reduction

Mathematics Subject Classification ID

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

Related Items (3)

Solving linear multiplicative programs via branch-and-bound: a computational experience ⋮ An efficient algorithm and complexity result for solving the sum of general affine ratios problem ⋮ An accelerating outer space algorithm for globally solving generalized linear multiplicative problems

Cites Work

• Unnamed Item
• Range division and contraction algorithm for a class of global optimization problems
• Global minimization of a generalized linear multiplicative programming
• Linear decomposition approach for a class of nonconvex programming problems
• A new linearization method for generalized linear multiplicative programming
• An outcome-space finite algorithm for solving linear multiplicative programming
• Linearization method for a class of multiplicative programming with exponent
• An efficient algorithm for globally solving generalized linear multiplicative programming
• Practical global optimization for multiview geometry
• An outcome space approach for generalized convex multiplicative programs
• A nonisolated optimal solution of general linear multiplicative programming problems
• A global optimization approach for solving the convex multiplicative programming problem
• Solving long-term financial planning problems via global optimization
• Global optimization of multiplicative programs
• Heuristic methods for linear multiplicative programming
• A hybrid LP/NLP paradigm for global optimization relaxations
• Range division and linearization algorithm for a class of linear ratios optimization problems
• Global optimization for generalized linear multiplicative programming using convex relaxation
• Finite algorithm for generalized linear multiplicative programming
• A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
• Global algorithm for solving linear multiplicative programming problems
• Level set algorithm for solving convex multiplicative programming problems
• A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
• Robust Optimization of Large-Scale Systems
• Solving generalized polynomial problem by using new affine relaxed technique
• Image space branch-reduction-bound algorithm for globally minimizing a class of multiplicative problems

This page was built for publication: Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems