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

DOI10.1080/02331939408843918MaRDI QIDQ3835636zbMATH OpenOpenAlexFDO

Authors Hoang Tuy, Bui The Tam, Nguyen Dinh Dan

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

linearly constrained global optimizationparametric approachrank two propertysparse nonconvexity

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• Global minimization of a generalized convex multiplicative function
• On the global minimization of a convex function under general nonconvex constraints
• scientific article; zbMATH DE number 2210595
• A global optimization method for minimizing a product of two positive convex functions
• scientific article; zbMATH DE number 1225234

Cites work

• A global optimization approach for the linear two-level program
• An efficient solution method for rank two quasiconcave minimization problems
• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• Minimizing the sum of a convex function and the product of two affine functions over a convex set
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
• Quadratic programming with one negative eigenvalue is NP-hard
• The complementary convex structure in global optimization

Cited in

(9)

• Strongly polynomial time algorithms for certain concave minimization problems on networks
• An algorithm to minimize the sum of a semi-smooth function and a \(C^ 1\) function
• Existence results and optimal control for a class of quasi mixed equilibrium problems involving the \((f,g,h)\)-quasimonotonicity
• A proximal alternating linearization method for nonconvex optimization problems
• Two methods for minimizing convex functions in a class of nonconvex sets
• scientific article; zbMATH DE number 4062841 (Why is no real title available?)
• Minimizing the sum of a convex function and the product of two affine functions over a convex set
• A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
• An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems

This page was built for publication: Minimizing the sum of a convex function and a specially structured nonconvex function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3835636)