An out space accelerating algorithm for generalized affine multiplicative programs problem

DOI10.1155/2017/5249160zbMath1408.90239OpenAlexW2626919280WikidataQ59145605 ScholiaQ59145605MaRDI QIDQ1794179

Zhisong Hou, Jingben Yin, Shuai Tang, Lei Cai, Hong-Wei Jiao

Publication date: 15 October 2018

Published in: Journal of Control Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2017/5249160

zbMATH Keywords

nonconvex programsaffine multiplicative programs problemout space branch-and-bound algorithm

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Global minimization of a generalized linear multiplicative programming
• A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
• A nonisolated optimal solution of general linear multiplicative programming problems
• Optimization on low rank nonconvex structures
• Global optimization of multiplicative programs
• A unified monotonic approach to generalized linear fractional programming
• Heuristic methods for linear multiplicative programming
• Outcome-space cutting-plane algorithm for linear multiplicative programming
• Reverse polyblock approximation for generalized multiplicative/fractional programming
• Finite algorithm for generalized linear multiplicative programming
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
• A numerical solution method to interval quadratic programming
• A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints
• A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints
• A decomposition algorithm for solving large-scale quadratic programming problems
• Global optimization algorithm for a generalized linear multiplicative programming
• A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems

This page was built for publication: An out space accelerating algorithm for generalized affine multiplicative programs problem