Pages that link to "Item:Q3757698"

The following pages link to Global minimization of a difference of two convex functions (Q3757698):

Displaying 42 items.

• The impact of cost uncertainty on the location of a distribution center (Q439510) (← links)
• A framework of discrete DC programming by discrete convex analysis (Q494333) (← links)
• On global unconstrained minimization of the difference of polyhedral functions (Q540713) (← links)
• Characterization of d.c. Functions in terms of quasidifferentials (Q640206) (← links)
• Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
• An algorithm for solving convex programs with an additional convex- concave constraint (Q689151) (← links)
• Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
• On difference of two monotone operators (Q839795) (← links)
• A new bound-and-reduce approach of nonconvex quadratic programming problems (Q902837) (← links)
• Some new Farkas-type results for inequality systems with DC functions (Q925237) (← links)
• Method for minimizing a convex-concave function over a convex set (Q1176848) (← links)
• Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming (Q1184526) (← links)
• On solving a d.c. programming problem by a sequence of linear programs (Q1186273) (← links)
• Calculation of bounds on variables satisfying nonlinear inequality constraints (Q1207040) (← links)
• Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems (Q1321233) (← links)
• Primal-relaxed dual global optimization approach (Q1321372) (← links)
• Branch-and-bound decomposition approach for solving quasiconvex-concave programs (Q1333350) (← links)
• D.C. representability of closed sets in reflexive Banach spaces and applications to optimization problems (Q1359460) (← links)
• Necessary and sufficient global optimality conditions for convex maximization revisited (Q1378644) (← links)
• On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
• On the pervasiveness of difference-convexity in optimization and statistics (Q1739035) (← links)
• DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445) (← links)
• Convex minimization under Lipschitz constraints (Q1823144) (← links)
• A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem (Q1890947) (← links)
• A d.c. optimization method for single facility location problems (Q1904649) (← links)
• A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961) (← links)
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems (Q1913605) (← links)
• A new necessary and sufficient global optimality condition for canonical DC problems (Q1945515) (← links)
• A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations (Q2163076) (← links)
• Equilibrium refinement for a model of non-monocentric internal structures of cities: a potential game approach (Q2173105) (← links)
• Solving polyhedral d.c. optimization problems via concave minimization (Q2200081) (← links)
• Outer approximation algorithms for canonical DC problems (Q2269586) (← links)
• New global optimality conditions for nonsmooth DC optimization problems (Q2301178) (← links)
• General variational inclusions involving difference of operators (Q2405588) (← links)
• A new class of improved convex underestimators for twice continuously differentiable constrained NLPs (Q2574101) (← links)
• On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
• A decomposition approach for global optimum search in QP, NLP and MINLP problems (Q2638940) (← links)
• A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
• Computing B-Stationary Points of Nonsmooth DC Programs (Q2976143) (← links)
• A decomposition method for the min concave cost flow problem with a staircase structure (Q3471825) (← links)
• Deterministic methods in constrained global optimization: Some recent advances and new fields of application (Q3494393) (← links)
• (Q5750730) (← links)