Pages that link to "Item:Q1186273"

The following pages link to On solving a d.c. programming problem by a sequence of linear programs (Q1186273):

Displaying 37 items.

• Exact penalty and error bounds in DC programming (Q427389) (← links)
• Solving DC programs using the cutting angle method (Q486726) (← links)
• Sequential location of two facilities: comparing random to optimal location of the first facility (Q512975) (← links)
• A branch and reduce approach for solving a class of low rank d.c. programs (Q732158) (← links)
• Outer approximation method incorporating a quadratic approximation for a DC programming problem (Q848730) (← links)
• Constructing a DC decomposition for ordered median problems (Q1037351) (← links)
• The design centering problem as a d.c. programming problem (Q1106730) (← links)
• The maximization of a function over the efficient set via a penalty function approach (Q1278284) (← links)
• The simplex method as a global optimizer: A \(C\)-programming perspective (Q1315444) (← links)
• A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems (Q1321648) (← links)
• An algorithm for solving general D. C. programming problems (Q1332952) (← links)
• Branch-and-bound decomposition approach for solving quasiconvex-concave programs (Q1333350) (← links)
• Convex analysis approach to d. c. programming: Theory, algorithms and applications (Q1384439) (← links)
• Extremal problems with d.c.-contraints. (Q1395156) (← links)
• DC programming and DCA for solving Brugnano-Casulli piecewise linear systems (Q1652418) (← links)
• Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver (Q1679488) (← links)
• D.C. programming approach for solving an applied ore-processing problem (Q1716969) (← links)
• DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445) (← links)
• The hill detouring method for minimizing hinging hyperplanes functions (Q1762167) (← links)
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961) (← links)
• Difference of convex solution of quadratically constrained optimization problems. (Q1810525) (← links)
• A finite algorithm for a particular D.C. quadratic programming problem (Q1861916) (← links)
• A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem (Q1890947) (← links)
• Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems (Q1924614) (← links)
• DC programming: overview. (Q1969457) (← links)
• Sequential difference-of-convex programming (Q2198538) (← links)
• Solving polyhedral d.c. optimization problems via concave minimization (Q2200081) (← links)
• A new concave reformulation and its application in solving DC programming globally under uncertain environment (Q2244216) (← links)
• Variations and extension of the convex-concave procedure (Q2358020) (← links)
• A subgradient-based convex approximations method for DC programming and its applications (Q2358301) (← links)
• A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
• Solution of the multisource Weber and conditional Weber problems by d. -c. programming (Q2770097) (← links)
• Global minimization of a difference of two convex functions (Q3757698) (← links)
• A modified version of Tuy's method for solving d.c. programing problem (Q3813618) (← links)
• A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential (Q4293262) (← links)
• On a Markov Decision Process problem involving the Maximum of the Difference between two functions: Technical Note (Q4718599) (← links)
• Convex Maximization via Adjustable Robust Optimization (Q5106408) (← links)