Canonical DC programming problem: Outer approximation methods revisited
type: Item
instance of: scholarly article
title: Canonical DC programming problem: Outer approximation methods revisited
zbMATH Open document ID: 0857.90123
DOI: 10.1016/0167-6377(95)00037-X
author: Hoang Tuy
published in: Operations Research Letters
publication date: 1996-08-01T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 912518
zbMATH Keywords: canonical DC programming
zbMATH Keywords: additional reverse convex constraint
zbMATH Keywords: outer approximation
zbMATH Keywords: cutting plane approaches
MaRDI profile type: Publication
cites work: A level set algorithm for a class of reverse convex programs
cites work: Comments on a reverse convex programming algorithm
cites work: On-line and off-line vertex enumeration by adjacency lists
cites work: Newton's method for convex programming and Tschebyscheff approximation
cites work: A Successive Underestimation Method for Concave Minimization Problems
cites work: A finite cutting plane method for solving linear programs with an additional reverse convex constraint
cites work: Reverse convex programming
cites work: A method for globally minimizing concave functions over convex sets
cites work: On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Q5638112
cites work: An outer approximation method for globally minimizing a concave function over a compact convex set
cites work: A modified version of Tuy's method for solving d.c. programing problem
cites work: Q5342287
cites work: On outer approximation methods for solving concave minimization problems
cites work: Q3761588
cites work: Convex programs with an additional reverse convex constraint
cites work: Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
cites work: The Supporting Hyperplane Method for Unimodal Programming
full work available at URL: 0167-6377(95)00037-x
OpenAlex ID: W2064451830
Recommended article: Outer approximation algorithms for canonical DC problems
Recommended article: Q3007196
Recommended article: Outer approximation method incorporating a quadratic approximation for a DC programming problem
Recommended article: Outer approximation algorithms for DC programs and beyond
Recommended article: Lagrange duality in canonical DC programming
Recommended article: Successive search methods for solving a canonical DC programming problem
Recommended article: On modeling and global solutions for d.c. optimization problems by canonical duality theory
Recommended article: An optimal bound for d. c. programs with convex constraints
Recommended article: Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
Recommended article: A new necessary and sufficient global optimality condition for canonical DC problems
description: scientific article; zbMATH DE number 912518