Minimizing the sum of a convex function and a specially structured nonconvex function
From MaRDI portal
Publication:3835636
DOI10.1080/02331939408843918zbMath0819.90096OpenAlexW2019040870MaRDI QIDQ3835636
Bui The Tam, Hoang Tuy, 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
Related Items
An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems, A proximal alternating linearization method for nonconvex optimization problems, Existence results and optimal control for a class of quasi mixed equilibrium problems involving the \((f,g,h)\)-quasimonotonicity, A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems, 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