The following pages link to (Q3997222):
Displaying 50 items.
- Global optimization from concave minimization to concave mixed variational inequality (Q778156) (← links)
- Concave minimization via conical partitions and polyhedral outer approximation (Q811411) (← links)
- Global optimization. From theory to implementation. (Q819915) (← links)
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems (Q839044) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Modular global optimisation in chemical engineering (Q842720) (← links)
- Global optimization of truss topology with discrete bar areas. II: Implementation and numerical results (Q849084) (← links)
- Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems (Q868630) (← links)
- A deterministic global optimization algorithm (Q870181) (← links)
- Criteria for unconstrained global optimization (Q927205) (← links)
- Global maximization of a generalized concave multiplicative function (Q927239) (← links)
- Generalized semi-infinite programming: a tutorial (Q929611) (← links)
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- Global optimization for special reverse convex programming (Q931747) (← links)
- On Nash-Cournot oligopolistic market equilibrium models with concave cost functions (Q934791) (← links)
- On the closure of the feasible set in generalized semi-infinite programming (Q940805) (← links)
- A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
- Existence and sum decomposition of vertex polyhedral convex envelopes (Q941026) (← links)
- A note on a deterministic global optimization algorithm (Q941475) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- Nonconvex piecewise linear knapsack problems (Q948649) (← links)
- Alternating local search based VNS for linear classification (Q970175) (← links)
- Piecewise-linear approximations of multidimensional functions (Q970578) (← links)
- A fast memoryless interval-based algorithm for global optimization (Q975771) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- On the subdifferentiability of the difference of two functions and local minimization (Q1005123) (← links)
- Conditions for boundedness in concave programming under reverse convex and convex constraints (Q1006541) (← links)
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions (Q1024827) (← links)
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions (Q1024828) (← links)
- On generalization performance and non-convex optimization of extended \(\nu \)-support vector machine (Q1031941) (← links)
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms (Q1177911) (← links)
- An all-linear programming relaxation algorithm for optimizing over the efficient set (Q1177916) (← links)
- Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming (Q1184526) (← links)
- Level-constrained programming (Q1184818) (← links)
- What can interval analysis do for global optimization? (Q1186266) (← 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)
- A new simplicial cover technique in constrained global optimization (Q1187367) (← links)
- The complementary convex structure in global optimization (Q1187368) (← links)
- Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← links)
- Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization (Q1187370) (← links)
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (Q1187374) (← links)
- On nonconvex optimization problems with separated nonconvex variables (Q1187838) (← links)
- An optimality criterion for global quadratic optimization (Q1187846) (← links)
- Convergence qualification of adaptive partition algorithms in global optimization (Q1196187) (← links)
- Generalized bilinear programming. I: Models, applications and linear programming relaxation (Q1199512) (← links)
- A global optimization approach for solving the convex multiplicative programming problem (Q1200524) (← links)
- An application of Lipschitzian global optimization to product design (Q1200528) (← links)
- Polyhedral annexation, dualization and dimension reduction technique in global optimization (Q1200635) (← links)
- A parametric successive underestimation method for convex multiplicative programming problems (Q1200637) (← links)
