Solving DC programs using the cutting angle method
type: Item
instance of: scholarly article
title: Solving DC programs using the cutting angle method
zbMATH Open document ID: 1312.90059
author: Albert Ferrer
author: Gleb Beliakov
author: A. M. Bagirov
published in: Journal of Global Optimization
publication date: 2015-01-16T00:00:00Z
full work available at URL: http://hdl.handle.net/2117/21984
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6387228
zbMATH Keywords: DC programming
zbMATH Keywords: Lipschitz programming
zbMATH Keywords: cutting angle method
MaRDI profile type: Publication
OpenAlex ID: W2037346764
cites work: Global minimization of increasing positively homogeneous functions over the unit simplex
cites work: Modified versions of the cutting angle method.
cites work: Fast algorithm for the cutting angle method of global optimization
cites work: Geometry and combinatorics of the cutting angle method
cites work: Cutting angle method – a tool for constrained global optimization
cites work: Q5494170
cites work: Q5453761
cites work: Q4464626
cites work: Newton's method for convex programming and Tschebyscheff approximation
cites work: Benchmarking optimization software with performance profiles.
cites work: Q2751334
cites work: Finite problems and the logic of the weak law of excluded middle
cites work: On functions representable as a difference of convex functions
cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
cites work: A production-transportation problem with stochastic demand and concave production costs
cites work: Q3997222
cites work: Introduction to global optimization
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Optimization on low rank nonconvex structures
cites work: Q5807757
cites work: Approximation and decomposition properties of some classes of locally d.c. functions
cites work: Solution of the multisource Weber and conditional Weber problems by d. -c. programming
cites work: Abstract convexity and global optimization
cites work: Testing the \({\mathfrak R}\)-strategy for a reverse convex problem
cites work: Convex analysis and global optimization
cites work: Strong and Weak Convexity of Sets and Functions
DOI: 10.1007/S10898-014-0159-1
Recommended article: Solving Quadratic Programming by Cutting Planes
Recommended article: Cutting angle method and a local search
Recommended article: Cutting angle methods in global optimization
Recommended article: On solving linear complementarity problems by DC programming and DCA
Recommended article: An exact method for solving the subproblem of the cutting angle method of global optimization.
Recommended article: DC programming and DCA for solving Brugnano-Casulli piecewise linear systems
Recommended article: On solving a d.c. programming problem by a sequence of linear programs
Recommended article: Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver
Recommended article: Successive search methods for solving a canonical DC programming problem
description: scientific article; zbMATH DE number 6387228