Pages that link to "Item:Q1913605"
From MaRDI portal
The following pages link to \(\alpha BB\): A global optimization method for general constrained nonconvex problems (Q1913605):
Displaying 50 items.
- alphaBB (Q18382) (← links)
- A branch-and-bound multi-parametric programming approach for non-convex multilevel optimization with polyhedral constraints (Q280097) (← links)
- A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics (Q285928) (← links)
- A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints (Q301393) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
- A reformulation framework for global optimization (Q367160) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- Rigorous filtering using linear relaxations (Q453629) (← links)
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423) (← links)
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
- A modified DIRECT algorithm with bilevel partition (Q480826) (← links)
- A reliable affine relaxation method for global optimization (Q496103) (← links)
- Enclosure of all index-1 saddle points of general nonlinear functions (Q513158) (← links)
- How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- Global descent methods for unconstrained global optimization (Q548179) (← links)
- Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution (Q621684) (← links)
- Convergence rate of McCormick relaxations (Q656830) (← links)
- Generalized McCormick relaxations (Q656963) (← links)
- Low order-value approach for solving var-constrained optimization problems (Q656968) (← links)
- On the global optimization of sums of linear fractional functions over a convex set (Q704748) (← links)
- A new class of hybrid global optimization algorithms for peptide structure prediction: integrated hybrids (Q709368) (← links)
- Testing pseudoconvexity via interval computation (Q721159) (← links)
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Q742114) (← links)
- The cluster problem revisited (Q742132) (← links)
- Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
- Proof of convergence for a global optimization algorithm for problems with ordinary differential equations (Q811878) (← links)
- Interval analysis on directed acyclic graphs for global optimization (Q816066) (← links)
- Reverse logistics network design with stochastic lead times (Q850286) (← links)
- Existence and sum decomposition of vertex polyhedral convex envelopes (Q941026) (← links)
- A new global optimization method for univariate constrained twice-differentiable NLP problems (Q946347) (← 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)
- GMG -- a guaranteed global optimization algorithm: application to remote sensing (Q1025687) (← links)
- Global optimization of robust chance constrained problems (Q1029686) (← links)
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems (Q1029695) (← links)
- Cutting circles and polygons from area-minimizing rectangles (Q1029696) (← links)
- Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
- Nonlinear programming for multiperiod capacity planning in a manufacturing system (Q1278476) (← links)
- Archimedean polyhedron structure yields a lower energy atomic cluster (Q1392814) (← links)
- Lower bound functions for polynomials (Q1405189) (← links)
- Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming (Q1628043) (← links)
- Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations (Q1642979) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
- An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems (Q1668794) (← links)
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains (Q1668799) (← links)
- A computational study of global optimization solvers on two trust region subproblems (Q1668805) (← links)
- On solving generalized convex MINLP problems using supporting hyperplane techniques (Q1668811) (← links)
