Minimizing the sum of a convex function and a specially structured nonconvex function

DOI10.1080/02331939408843918zbMath0819.90096MaRDI QIDQ3835636

Hoang Tuy, Nguyen Dinh Dan, Bui The Tam

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939408843918

zbMATH Keywords

parametric approach; linearly constrained global optimization; rank two property; sparse nonconvexity

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C30: Nonlinear programming

Related Items

Strongly polynomial time algorithms for certain concave minimization problems on networks

Cites Work

• Unnamed Item
• Quadratic programming with one negative eigenvalue is NP-hard
• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• The complementary convex structure in global optimization
• A global optimization approach for the linear two-level program
• Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
• An efficient solution method for rank two quasiconcave minimization problems
• Minimizing the sum of a convex function and the product of two affine functions over a convex set