Solving DC programs using the cutting angle method

DOI10.1007/s10898-014-0159-1zbMath1312.90059OpenAlexW2037346764MaRDI QIDQ486726

Albert Ferrer, Gleb Beliakov, Adil M. Bagirov

Publication date: 16 January 2015

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/21984

zbMATH Keywords

cutting angle methodDC programmingLipschitz programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (10)

Global convergence of a proximal linearized algorithm for difference of convex functions ⋮ A novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization ⋮ Approximation by Delta-Convex Mappings in Certain Spaces ⋮ Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver ⋮ A modified proximal point method for DC functions on Hadamard manifolds ⋮ Solving polyhedral d.c. optimization problems via concave minimization ⋮ Generalized cutting plane method for solving nonlinear stochastic programming problems ⋮ DC optimization for constructing discrete Sugeno integrals and learning nonadditive measures ⋮ A vector linear programming approach for certain global optimization problems ⋮ A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems

Cites Work

• On functions representable as a difference of convex functions
• Approximation and decomposition properties of some classes of locally d.c. functions
• Newton's method for convex programming and Tschebyscheff approximation
• Testing the \({\mathfrak R}\)-strategy for a reverse convex problem
• A production-transportation problem with stochastic demand and concave production costs
• Optimization on low rank nonconvex structures
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Fast algorithm for the cutting angle method of global optimization
• Introduction to global optimization
• Finite problems and the logic of the weak law of excluded middle
• Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming
• Strong and Weak Convexity of Sets and Functions
• Cutting angle method – a tool for constrained global optimization
• The Cutting-Plane Method for Solving Convex Programs
• Geometry and combinatorics of the cutting angle method
• Convex analysis and global optimization
• Global minimization of increasing positively homogeneous functions over the unit simplex
• Abstract convexity and global optimization
• Benchmarking optimization software with performance profiles.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving DC programs using the cutting angle method