Outer approximation algorithms for canonical DC problems
From MaRDI portal
Publication:2269586
DOI10.1007/S10898-009-9415-1zbMATH Open1188.90199OpenAlexW2044800863WikidataQ118165489 ScholiaQ118165489MaRDI QIDQ2269586FDOQ2269586
Authors: Giancarlo Bigi, Antonio Frangioni, Qing-Hua Zhang 
Publication date: 17 March 2010
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://eprints.adm.unipi.it/2179/1/TR%2D07%2D06.pdf.gz
Recommendations
- Outer approximation algorithms for DC programs and beyond
- Beyond canonical dc-optimization: the single reverse polar problem
- Canonical DC programming problem: Outer approximation methods revisited
- Outer approximation method incorporating a quadratic approximation for a DC programming problem
- scientific article; zbMATH DE number 4064775
Cites Work
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Title not available (Why is that?)
- Convex Analysis
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Handbook of global optimization
- Optimization techniques for semi-supervised support vector machines
- Convex analysis and global optimization
- Normal conical algorithm for concave minimization over polytopes
- A convex envelope formula for multilinear functions
- Global optimization of multiplicative programs
- Global optimization. Scientific and engineering case studies
- Efficient Total Variation Minimization Methods for Color Image Restoration
- A quasiconcave minimization method for solving linear two-level programs
- A method for solving reverse convex programming problems
- Global minimization of a difference of two convex functions
- Testing the \({\mathfrak R}\)-strategy for a reverse convex problem
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- A modified version of Tuy's method for solving d.c. programing problem
- Convex programs with an additional reverse convex constraint
- On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- A level set algorithm for a class of reverse convex programs
- Convex programs with several additional reverse convex constraints
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint
- Canonical DC programming problem: Outer approximation methods revisited
- Comments on a reverse convex programming algorithm
- Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization
- On nonconvex optimization problems with separated nonconvex variables
- Title not available (Why is that?)
- Polyhedral annexation vs outer approximation for the decomposition of monotonic quasiconcave minimization problems
- Letter to the editor: Remarks on an algorithm for reverse convex programs
Cited In (7)
- Title not available (Why is that?)
- A new necessary and sufficient global optimality condition for canonical DC problems
- Beyond canonical dc-optimization: the single reverse polar problem
- A branch and reduce approach for solving a class of low rank d.c. programs
- Outer approximation algorithms for DC programs and beyond
- Canonical DC programming problem: Outer approximation methods revisited
- New global optimality conditions for nonsmooth DC optimization problems
This page was built for publication: Outer approximation algorithms for canonical DC problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2269586)
