A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
From MaRDI portal
Publication:2075981
DOI10.1016/j.cam.2021.114080zbMath1485.90099OpenAlexW4206476771MaRDI QIDQ2075981
Yaping Deng, Chun-Feng Wang, Pei-Ping Shen
Publication date: 16 February 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.2021.114080
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Uses Software
Cites Work
- Linear decomposition approach for a class of nonconvex programming problems
- Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
- 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
- Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm
- Linear multiplicative programming
- A mean-absolute deviation-skewness portfolio optimization model
- Bilinear separation of two sets in \(n\)-space
- Solving long-term financial planning problems via global optimization
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
- Global optimization for generalized linear multiplicative programming using convex relaxation
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- A deterministic approach to linear programs with several additional multiplicative constraints
- BARON: A general purpose global optimization software package
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- Global algorithm for solving linear multiplicative programming problems
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- Global optimization method for linear multiplicative programming
- A method of acceleration for a class of multiplicative programming problems with exponent
- Global optimization algorithm for a generalized linear multiplicative programming
- 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
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
This page was built for publication: A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
