On global optimality conditions and cutting plane algorithms
type: Item
instance of: scholarly article
title: On global optimality conditions and cutting plane algorithms
zbMATH Open document ID: 1033.90094
DOI: 10.1023/A:1024751811328
author: Hoang Tuy
published in: Journal of Optimization Theory and Applications
publication date: 2003-09-15T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 1981580
zbMATH Keywords: Global optimization
zbMATH Keywords: DC programming
zbMATH Keywords: optimality conditions
zbMATH Keywords: cutting plane algorithms
MaRDI profile type: Publication
cites work: DC programming: overview.
cites work: On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization
cites work: Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
cites work: On the construction of test problems for concave minimization algorithms
cites work: A modified version of Tuy's method for solving d.c. programing problem
cites work: Introduction to global optimization.
cites work: Can linear programs be used to test global optimization algorithms?
cites work: Canonical DC programming problem: Outer approximation methods revisited
cites work: Q4889854
cites work: Q3951124
cites work: Convex programs with an additional reverse convex constraint
cites work: Q4833805
cites work: Convex analysis and global optimization
cites work: Q4313254
cites work: Q3972966
cites work: Monotonic optimization: Problems and solution approaches
cites work: Abstract convexity and global optimization
cites work: A method for globally minimizing concave functions over convex sets
Recommended article: Q3127067
Recommended article: On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
Recommended article: Q4694565
Recommended article: Cutting Plane Algorithm for Convex Generalized Disjunctive Programs
Recommended article: Cutting plane algorithms for nonlinear semi-definite programming problems with applications
Recommended article: Imbedding and cutting methods for global optimization and their applications
Recommended article: Cutting plane algorithms for robust conic convex optimization problems
Recommended article: Q3787798
Recommended article: Q4296848
Recommended article: A projection cutting plane algorithm for convex programming problems
description: scientific article; zbMATH DE number 1981580