Linear decomposition approach for a class of nonconvex programming problems

DOI10.1186/s13660-017-1342-yzbMath1360.90239OpenAlexW2606801465WikidataQ33569416 ScholiaQ33569416MaRDI QIDQ523884

Chun-Feng Wang, Pei-Ping Shen

Publication date: 24 April 2017

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-017-1342-y

zbMATH Keywords

computational complexityglobal optimizationnonconvex programmingapproximation algorithmlinear decomposition approach

Mathematics Subject Classification ID

Nonlinear programming (90C30) Stochastic programming (90C15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (13)

Solving a class of generalized fractional programming problems using the feasibility of linear programs ⋮ An accelerating algorithm for globally solving nonconvex quadratic programming ⋮ A parametric linearizing approach for quadratically inequality constrained quadratic programs ⋮ Solving generalized polynomial problem by using new affine relaxed technique ⋮ Global optimization algorithm for solving linear multiplicative programming problems ⋮ Global algorithm for solving linear multiplicative programming problems ⋮ An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming ⋮ A potential practical algorithm for minimizing the sum of affine fractional functions ⋮ Range division and linearization algorithm for a class of linear ratios optimization problems ⋮ Outer space branch and bound algorithm for solving linear multiplicative programming problems ⋮ A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems ⋮ Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems ⋮ An effective global optimization algorithm for quadratic programs with quadratic constraints

Cites Work

• Unnamed Item
• A practicable branch and bound algorithm for sum of linear ratios problem
• An FPTAS for optimizing a class of low-rank functions over a polytope
• Approximation of linear fractional-multiplicative problems
• A new linearization method for generalized linear multiplicative programming
• An FPTAS for minimizing the product of two non-negative linear cost functions
• Approximation algorithms for indefinite quadratic programming
• A FPTAS for a class of linear multiplicative problems
• Quadratic programming and combinatorial minimum weight product problems
• Quadratic programming with one negative eigenvalue is NP-hard
• Generalized bilinear programming: An application in farm management
• Cutting plane/tabu search algorithms for low rank concave quadratic programming problems
• A mean-absolute deviation-skewness portfolio optimization model
• Optimization on low rank nonconvex structures
• Solving long-term financial planning problems via global optimization
• An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
• A global optimization algorithm for linear fractional programming
• Global optimization for sum of linear ratios problem with coefficients
• \(NP\)-hardness of linear multiplicative programming and related problems
• Cutting Planes for Low-Rank-Like Concave Minimization Problems

This page was built for publication: Linear decomposition approach for a class of nonconvex programming problems