Global minimization of a difference of two convex functions

difference of two convex functions concave minimization outer approximations indefinite quadratic programming generalized Benders' decomposition convex polyhedral domain

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Cited In (46)

A d.c. optimization method for single facility location problems
Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
An algorithm for solving convex programs with an additional convex- concave constraint
On difference of two monotone operators
A new necessary and sufficient global optimality condition for canonical DC problems
On the pervasiveness of difference-convexity in optimization and statistics
Method for minimizing a convex-concave function over a convex set
Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
A decomposition method for the min concave cost flow problem with a staircase structure
Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
Minimizing the Difference of Dual Functions of Two Coradiant Functions
DC decomposition of nonconvex polynomials with algebraic techniques
Title not available (Why is that?)
Necessary and sufficient global optimality conditions for convex maximization revisited
Global optimization algorithms for linearly constrained indefinite quadratic problems
The impact of cost uncertainty on the location of a distribution center
Some new Farkas-type results for inequality systems with DC functions
A continuous approch for globally solving linearly constrained quadratic
Solving polyhedral d.c. optimization problems via concave minimization
On solving a d.c. programming problem by a sequence of linear programs
Calculation of bounds on variables satisfying nonlinear inequality constraints
Convex minimization under Lipschitz constraints
A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
Equilibrium refinement for a model of non-monocentric internal structures of cities: a potential game approach
A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations
Global minimization of a generalized convex multiplicative function
A new bound-and-reduce approach of nonconvex quadratic programming problems
Branch-and-bound decomposition approach for solving quasiconvex-concave programs
D.C. representability of closed sets in reflexive Banach spaces and applications to optimization problems
Title not available (Why is that?)
Characterization of d.c. Functions in terms of quasidifferentials
A reformulation-convexification approach for solving nonconvex quadratic programming problems
On linear programming relaxations for solving polynomial programming problems
Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds
Primal-relaxed dual global optimization approach
A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
On global unconstrained minimization of the difference of polyhedral functions
A framework of discrete DC programming by discrete convex analysis
General variational inclusions involving difference of operators
Deterministic methods in constrained global optimization: Some recent advances and new fields of application
A decomposition approach for global optimum search in QP, NLP and MINLP problems
Outer approximation algorithms for canonical DC problems
Computing B-Stationary Points of Nonsmooth DC Programs
New global optimality conditions for nonsmooth DC optimization problems
\(\alpha BB\): A global optimization method for general constrained nonconvex problems
On solving general reverse convex programming problems by a sequence of linear programs and line searches

This page was built for publication: Global minimization of a difference of two convex functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757698)