The following pages link to (Q4889854):
Displaying 50 items.
- Finding roots of nonlinear equations using the method of concave support functions (Q276656) (← links)
- A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm (Q286595) (← links)
- Solving dynamic public insurance games with endogenous agent distributions: theory and computational approximation (Q298374) (← links)
- On local search in d.c. optimization problems (Q299416) (← links)
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- Use of branch and bound method for search of an equilibrium in potential Cournot model (Q307757) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty (Q342259) (← links)
- Convergence analysis of Taylor models and McCormick-Taylor models (Q367158) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs (Q408205) (← links)
- A hybrid method for quantum global optimization (Q427367) (← links)
- Exact penalty and error bounds in DC programming (Q427389) (← links)
- Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme (Q433950) (← links)
- Global minimization of a generalized linear multiplicative programming (Q450102) (← links)
- Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control (Q467420) (← links)
- Interval methods for model qualification: methodology and advanced application (Q475446) (← links)
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results (Q480824) (← links)
- A penalty approximation method for a semilinear parabolic double obstacle problem (Q480830) (← links)
- Global optimization by multilevel partition (Q486722) (← links)
- A collision detection approach for maximizing the material utilization (Q493697) (← links)
- A reliable affine relaxation method for global optimization (Q496103) (← links)
- Reverse propagation of McCormick relaxations (Q496587) (← links)
- A penalty approach to a discretized double obstacle problem with derivative constraints (Q496614) (← links)
- Robust location transportation problems under uncertain demands (Q496635) (← links)
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques (Q506439) (← links)
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
- Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method (Q508045) (← links)
- Approximate Bayesian recursive estimation (Q508682) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems (Q522420) (← links)
- Convergence analysis of multivariate McCormick relaxations (Q524904) (← links)
- An augmented Lagrangian fish swarm based method for global optimization (Q555135) (← links)
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem (Q555995) (← links)
- Probabilistic subproblem selection in branch-and-bound algorithms (Q557739) (← links)
- Computation of multiple global optima through chaotic ant swarm (Q600603) (← links)
- Sign reversion approach to concave minimization problems (Q601974) (← links)
- Feasible method for generalized semi-infinite programming (Q604267) (← links)
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods (Q609566) (← links)
- A novel non-linear approach to minimal area rectangular packing (Q610981) (← links)
- P-algorithm based on a simplicial statistical model of multimodal functions (Q621736) (← links)
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks (Q628648) (← links)
- Dual and bidual problems for a Lipschitz optimization problem based on quasi-conjugation (Q631850) (← links)
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming (Q644521) (← links)
- Mission-based component testing for series systems (Q646630) (← links)
- Low dimensional simplex evolution: a new heuristic for global optimization (Q656836) (← links)
