Linear decomposition approach for a class of nonconvex programming problems
type: Item
instance of: scholarly article
title: Linear decomposition approach for a class of nonconvex programming problems
zbMATH Open document ID: 1360.90239
published in: Journal of Inequalities and Applications
publication date: 2017-04-24T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 6707522
zbMATH Keywords: nonconvex programming
zbMATH Keywords: global optimization
zbMATH Keywords: linear decomposition approach
zbMATH Keywords: approximation algorithm
zbMATH Keywords: computational complexity
author: Peiping Shen
author: Chunfeng Wang
MaRDI profile type: Publication
full work available at URL: s13660-017-1342-y
OpenAlex ID: W2606801465
Wikidata QID: Q33569416
cites work: Generalized bilinear programming: An application in farm management
cites work: A mean-absolute deviation-skewness portfolio optimization model
cites work: Solving long-term financial planning problems via global optimization
cites work: Quadratic programming with one negative eigenvalue is NP-hard
cites work: Q4352213
cites work: \(NP\)-hardness of linear multiplicative programming and related problems
cites work: An FPTAS for optimizing a class of low-rank functions over a polytope
cites work: Optimization on low rank nonconvex structures
cites work: Cutting plane/tabu search algorithms for low rank concave quadratic programming problems
cites work: Cutting Planes for Low-Rank-Like Concave Minimization Problems
cites work: Global optimization for sum of linear ratios problem with coefficients
cites work: A global optimization algorithm for linear fractional programming
cites work: A new linearization method for generalized linear multiplicative programming
cites work: A practicable branch and bound algorithm for sum of linear ratios problem
cites work: Approximation algorithms for indefinite quadratic programming
cites work: Approximation of linear fractional-multiplicative problems
cites work: A FPTAS for a class of linear multiplicative problems
cites work: An FPTAS for minimizing the product of two non-negative linear cost functions
cites work: An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
cites work: Quadratic programming and combinatorial minimum weight product problems
DOI: 10.1186/S13660-017-1342-Y
Recommended article: Q3727750
Recommended article: Decomposition in a non-linear programming problem with a non-convex constraint
Recommended article: Nonlinear proximal decomposition method for convex programming
Recommended article: Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions
Recommended article: On Decomposition Methods for a Class of Partially Separable Nonlinear Programs
Recommended article: A PRACTICAL APPROACH TO DECOMPOSABLE NONLINEAR PROGRAMMING PROBLEMS
Recommended article: Q3641206
Recommended article: Linear-programming approach to nonconvex variational problems
Recommended article: A Decomposition Method and Its Application to Convex Programming
Recommended article: Q3727739
description: scientific article; zbMATH DE number 6707522