Global optimization algorithm for solving linear multiplicative programming problems
From MaRDI portal
Publication:5085229
DOI10.1080/02331934.2020.1812603zbMath1489.90141OpenAlexW3083412729MaRDI QIDQ5085229
Ting Lu, Kai-Min Wang, Pei-Ping Shen
Publication date: 27 June 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2020.1812603
computational complexityglobal optimizationbranch and boundlinear multiplicative programminglinear relaxation technique
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (3)
Solving linear multiplicative programs via branch-and-bound: a computational experience ⋮ An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming ⋮ Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound
Uses Software
Cites Work
- 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
- An FPTAS for minimizing the product of two non-negative linear cost functions
- An outer approximation method for minimizing the product of several convex functions on a convex set
- An efficient algorithm for globally solving generalized linear multiplicative programming
- Global maximization of a generalized concave multiplicative function
- Generalized convexity and optimization. Theory and applications
- Practical global optimization for multiview geometry
- An outcome space approach for generalized convex multiplicative programs
- A new global optimization approach for convex multiplicative programming
- A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions
- A nonisolated optimal solution of general linear multiplicative programming problems
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Global minimization of a generalized convex multiplicative function
- Bilinear separation of two sets in \(n\)-space
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
- Optimization on low rank nonconvex structures
- Solving long-term financial planning problems via global optimization
- Heuristic methods for linear multiplicative programming
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Global optimization for generalized linear multiplicative programming using convex relaxation
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- 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
- Introduction to global optimization
- Finite algorithm for generalized linear multiplicative programming
- BARON: A general purpose global optimization software package
- Global algorithm for solving linear multiplicative programming problems
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- A method of acceleration for a class of multiplicative programming problems with exponent
- Global optimization of a rank-two nonconvex program
- A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative 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
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Robust Optimization of Large-Scale Systems
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Convex analysis and global optimization
- Unnamed Item
- Unnamed Item
This page was built for publication: Global optimization algorithm for solving linear multiplicative programming problems
