Global minimization of a difference of two convex functions
From MaRDI portal
Publication:3757698
DOI10.1007/BFb0121159zbMath0619.90061OpenAlexW1547127570MaRDI QIDQ3757698
Publication date: 1987
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0121159
concave minimizationdifference of two convex functionsouter approximationsindefinite quadratic programminggeneralized Benders' decompositionconvex polyhedral domain
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items (42)
Deterministic methods in constrained global optimization: Some recent advances and new fields of application ⋮ Branch-and-bound decomposition approach for solving quasiconvex-concave programs ⋮ On difference of two monotone operators ⋮ A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem ⋮ On solving general reverse convex programming problems by a sequence of linear programs and line searches ⋮ A decomposition approach for global optimum search in QP, NLP and MINLP problems ⋮ D.C. representability of closed sets in reflexive Banach spaces and applications to optimization problems ⋮ A d.c. optimization method for single facility location problems ⋮ A reformulation-convexification approach for solving nonconvex quadratic programming problems ⋮ On linear programming relaxations for solving polynomial programming problems ⋮ A decomposition method for the min concave cost flow problem with a staircase structure ⋮ A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations ⋮ \(\alpha BB\): A global optimization method for general constrained nonconvex problems ⋮ Equilibrium refinement for a model of non-monocentric internal structures of cities: a potential game approach ⋮ General variational inclusions involving difference of operators ⋮ Necessary and sufficient global optimality conditions for convex maximization revisited ⋮ A new bound-and-reduce approach of nonconvex quadratic programming problems ⋮ A new necessary and sufficient global optimality condition for canonical DC problems ⋮ Solving polyhedral d.c. optimization problems via concave minimization ⋮ The impact of cost uncertainty on the location of a distribution center ⋮ Characterization of d.c. Functions in terms of quasidifferentials ⋮ Computing B-Stationary Points of Nonsmooth DC Programs ⋮ Some new Farkas-type results for inequality systems with DC functions ⋮ Method for minimizing a convex-concave function over a convex set ⋮ Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming ⋮ A framework of discrete DC programming by discrete convex analysis ⋮ On the pervasiveness of difference-convexity in optimization and statistics ⋮ On solving a d.c. programming problem by a sequence of linear programs ⋮ DC decomposition of nonconvex polynomials with algebraic techniques ⋮ 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 ⋮ Calculation of bounds on variables satisfying nonlinear inequality constraints ⋮ On global unconstrained minimization of the difference of polyhedral functions ⋮ A continuous approch for globally solving linearly constrained quadratic ⋮ Outer approximation algorithms for canonical DC problems ⋮ New global optimality conditions for nonsmooth DC optimization problems ⋮ Convex minimization under Lipschitz constraints ⋮ A new class of improved convex underestimators for twice continuously differentiable constrained NLPs ⋮ Unnamed Item ⋮ Global optimization algorithms for linearly constrained indefinite quadratic problems ⋮ Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems ⋮ Primal-relaxed dual global optimization approach
This page was built for publication: Global minimization of a difference of two convex functions
