Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound
From MaRDI portal
Publication:6162508
DOI10.1007/s10898-023-01277-wzbMath1519.90195MaRDI QIDQ6162508
Pei-Ping Shen, Kai-Min Wang, Dianxiao Wu
Publication date: 28 June 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
global optimizationbranch-and-boundlinear multiplicative programmingconvex quadratic relaxationsimplicial branching
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Global minimization of a generalized linear multiplicative programming
- An FPTAS for minimizing the product of two non-negative linear cost functions
- Global maximization of a generalized concave multiplicative function
- Generalized convexity and optimization. Theory and applications
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
- A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions
- Linear multiplicative programming
- Global minimization of a generalized convex multiplicative function
- Bilinear separation of two sets in \(n\)-space
- Solving long-term financial planning problems via global optimization
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- Reverse polyblock approximation for generalized multiplicative/fractional programming
- Finite algorithm for generalized linear multiplicative programming
- BARON: A general purpose global optimization software package
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- Underestimation functions for a rank-two partitioning method
- Inner approximation algorithm for generalized linear multiplicative programming problems
- Global algorithm for solving linear multiplicative programming problems
- A method of acceleration for a class of multiplicative programming problems with exponent
- Global optimization of a rank-two nonconvex program
- On the exhaustivity of simplicial partitioning
- A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints
- Global optimization algorithm for a generalized linear multiplicative programming
- \(NP\)-hardness of linear multiplicative programming and related problems
- On the minimization of a class of generalized linear functions on a flow polytope
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- Robust Optimization of Large-Scale Systems
- A new solution method for a class of large dimension rank-two nonconvex programs
- Global optimization algorithm for solving linear multiplicative programming problems
- Convex analysis and global optimization