Pages that link to "Item:Q1071651"

The following pages link to Convex programs with an additional reverse convex constraint (Q1071651):

Displaying 47 items.

• Outer approximation algorithms for DC programs and beyond (Q607880) (← links)
• A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming (Q644521) (← links)
• A generalized duality and applications (Q686992) (← links)
• An algorithm for solving convex programs with an additional convex- concave constraint (Q689151) (← links)
• A level set algorithm for a class of reverse convex programs (Q751513) (← links)
• Fuzzy linear and affine spaces (Q803230) (← links)
• Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications (Q811400) (← links)
• A finite cutting plane method for solving linear programs with an additional reverse convex constraint (Q910336) (← links)
• On the use of cuts in reverse convex programs (Q913668) (← links)
• Global optimization for special reverse convex programming (Q931747) (← links)
• \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization (Q989898) (← links)
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728) (← links)
• The design centering problem as a d.c. programming problem (Q1106730) (← links)
• On the global minimization of a convex function under general nonconvex constraints (Q1111474) (← links)
• Mathematical programs with a two-dimensional reverse convex constraint (Q1186268) (← links)
• On solving a d.c. programming problem by a sequence of linear programs (Q1186273) (← links)
• The complementary convex structure in global optimization (Q1187368) (← links)
• New types of variational principles based on the notion of quasidifferentiability (Q1193468) (← links)
• Calculation of bounds on variables satisfying nonlinear inequality constraints (Q1207040) (← links)
• Construction of test problems for concave minimization under linear and nonlinear constraints (Q1265043) (← links)
• On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization (Q1270696) (← links)
• Primal-relaxed dual global optimization approach (Q1321372) (← links)
• Convex programs with an additional constraint on the product of several convex functions (Q1333464) (← links)
• On global optimality conditions and cutting plane algorithms (Q1407243) (← links)
• Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function (Q1699146) (← links)
• New necessary and sufficient optimality conditions for strong bilevel programming problems (Q1702864) (← links)
• Difference of convex solution of quadratically constrained optimization problems. (Q1810525) (← links)
• Convex minimization under Lipschitz constraints (Q1823144) (← links)
• A new class of multilevel decomposition algorithms for non-monotone problems based on the quasidifferentiability concept (Q1913139) (← links)
• Canonical DC programming problem: Outer approximation methods revisited (Q1919172) (← links)
• A branch-and-reduce approach to global optimization (Q1924068) (← links)
• Beyond canonical dc-optimization: the single reverse polar problem (Q1935286) (← links)
• A new necessary and sufficient global optimality condition for canonical DC problems (Q1945515) (← links)
• Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision (Q1949258) (← links)
• DC programming: overview. (Q1969457) (← links)
• Some comments on Russell graph efficiency measures in data envelopment analysis: the multiplicative approach (Q2106765) (← links)
• A revision of the rectangular algorithm for a class of DC optimization problems (Q2141721) (← links)
• The complexity results of the sparse optimization problems and reverse convex optimization problems (Q2228394) (← links)
• Outer approximation algorithms for canonical DC problems (Q2269586) (← links)
• New global optimality conditions for nonsmooth DC optimization problems (Q2301178) (← links)
• Computational experience using an edge search algorithm for linear reverse convex programs (Q2564611) (← links)
• On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
• A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation (Q2688910) (← links)
• Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems (Q2877727) (← links)
• Intersection Disjunctions for Reverse Convex Sets (Q5076701) (← links)
• Duality and optimality conditions for reverse convex programs via a convex decomposition (Q6183466) (← links)
• Necessary optimality conditions for vector reverse convex minimization problems via a conjugate duality (Q6189128) (← links)