Pages that link to "Item:Q1090607"

The following pages link to Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization (Q1090607):

Displayed 47 items.

• Exact penalty and error bounds in DC programming (Q427389) ‎ (← links)
• Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control (Q467420) ‎ (← links)
• Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results (Q480824) ‎ (← 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)
• Interval method for bounding level sets: Revisited and tested with global optimization problems (Q804239) ‎ (← links)
• Concave minimization via conical partitions and polyhedral outer approximation (Q811411) ‎ (← links)
• Linearization method for a class of multiplicative programming with exponent (Q864775) ‎ (← links)
• Global optimization of generalized linear fractional programming with nonlinear constraints (Q865505) ‎ (← links)
• Global solution of bilevel programs with a nonconvex inner program (Q1016068) ‎ (← links)
• Global optimization for sum of linear ratios problem using new pruning technique (Q1023182) ‎ (← links)
• Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities (Q1090614) ‎ (← links)
• On consistency of bounding operations in deterministic global optimization (Q1101343) ‎ (← links)
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728) ‎ (← links)
• Multidimensional bisection applied to global optimisation (Q1174537) ‎ (← links)
• Method for minimizing a convex-concave function over a convex set (Q1176848) ‎ (← links)
• An all-linear programming relaxation algorithm for optimizing over the efficient set (Q1177916) ‎ (← links)
• An analytical approach to global optimization (Q1181733) ‎ (← 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)
• On nonconvex optimization problems with separated nonconvex variables (Q1187838) ‎ (← links)
• An application of Lipschitzian global optimization to product design (Q1200528) ‎ (← links)
• A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set (Q1321160) ‎ (← links)
• Branch-and-bound decomposition approach for solving quasiconvex-concave programs (Q1333350) ‎ (← links)
• Utility function programs and optimization over the efficient set in multiple-objective decision making (Q1356096) ‎ (← links)
• Global optimization of signomial geometric programming using linear relaxation. (Q1428180) ‎ (← links)
• A global optimization algorithm for signomial geometric programming problem (Q1722230) ‎ (← links)
• Linearization method of global optimization for generalized geometric programming (Q1763283) ‎ (← links)
• Global solution of semi-infinite programs (Q1780954) ‎ (← links)
• The impact of accelerating tools on the interval subdivision algorithm for global optimization (Q1804056) ‎ (← links)
• Deletion-by-infeasibility rule for DC-constrained global optimization (Q1893323) ‎ (← links)
• New LP bound in multivariate Lipschitz optimization: Theory and applications (Q1905038) ‎ (← links)
• DC programming: overview. (Q1969457) ‎ (← links)
• The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities (Q2136869) ‎ (← links)
• A note on adapting methods for continuous global optimization to the discrete case (Q2276877) ‎ (← links)
• Separable concave minimization via partial outer approximation and branch and bound (Q2277369) ‎ (← links)
• A decomposition method for MINLPs with Lipschitz continuous nonlinearities (Q2330657) ‎ (← links)
• A global optimization using linear relaxation for generalized geometric programming (Q2427180) ‎ (← links)
• Global optimization of bounded factorable functions with discontinuities (Q2442640) ‎ (← links)
• Accelerating method of global optimization for signomial geometric programming (Q2479370) ‎ (← links)
• A global optimization algorithm using linear relaxation (Q2507847) ‎ (← links)
• On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) ‎ (← links)
• Algorithmic differentiation techniques for global optimization in the COCONUT environment (Q2885482) ‎ (← links)
• Convex and concave relaxations of implicit functions (Q2943829) ‎ (← links)
• On convergence of "divide the best" global optimization algorithms (Q4944418) ‎ (← links)
• Intersection Disjunctions for Reverse Convex Sets (Q5076701) ‎ (← links)
• A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities (Q6050153) ‎ (← links)