Pages that link to "Item:Q1067978"
From MaRDI portal
The following pages link to A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization (Q1067978):
Displaying 50 items.
- Reducing transformation and global optimization (Q434589) (← links)
- Global optimization of generalized semi-infinite programs via restriction of the right hand side (Q486720) (← links)
- Optimization methods for mixed integer weakly concave programming problems (Q489113) (← links)
- A branch and bound-outer approximation algorithm for concave minimization over a convex set (Q757243) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← 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)
- Concave minimization via conical partitions and polyhedral outer approximation (Q811411) (← links)
- Globally optimized calibration of environmental models (Q922969) (← links)
- On the convergence of global methods in multiextremal optimization (Q1078082) (← links)
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization (Q1090607) (← links)
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728) (← links)
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems (Q1122325) (← links)
- An all-linear programming relaxation algorithm for optimizing over the efficient set (Q1177916) (← links)
- An analytical approach to global optimization (Q1181733) (← links)
- Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming (Q1184526) (← 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)
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (Q1187374) (← links)
- GBSSS: The generalized big square small square method for planar single- facility location (Q1196029) (← links)
- Convergence qualification of adaptive partition algorithms in global optimization (Q1196187) (← links)
- Global optimization of univariate Lipschitz functions. I: Survey and properties (Q1198732) (← links)
- An application of Lipschitzian global optimization to product design (Q1200528) (← links)
- A new reformulation-linearization technique for bilinear programming problems (Q1201905) (← links)
- On the global optimization properties of finite-difference local descent algorithms (Q1207044) (← links)
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set (Q1321160) (← links)
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems (Q1321233) (← links)
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
- Formulation assistance for global optimization problems (Q1373158) (← links)
- Experiments with new stochastic global optimization search techniques (Q1571032) (← links)
- A peak-over-threshold search method for global optimization (Q1640234) (← links)
- Global solution of semi-infinite programs (Q1780954) (← links)
- A relaxation method for nonconvex quadratically constrained quadratic programs (Q1892602) (← links)
- Deletion-by-infeasibility rule for DC-constrained global optimization (Q1893323) (← links)
- Nonconvex optimization over a polytope using generalized capacity improvement (Q1904646) (← links)
- A note on adapting methods for continuous global optimization to the discrete case (Q2276877) (← links)
- An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes (Q2276885) (← links)
- Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
- Active allocation of systematic risk and control of risk sensitivity in portfolio optimization (Q2355106) (← links)
- Variations and extension of the convex-concave procedure (Q2358020) (← links)
- A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions (Q2393063) (← links)
- A hybrid approach for index tracking with practical constraints (Q2438411) (← links)
- On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
- Global optimization of a quadratic function subject to a bounded mixed integer constraint set (Q2640438) (← links)
- Mean–variance portfolio optimization with parameter sensitivity control<sup>†</sup> (Q2829560) (← links)
- Algorithmic differentiation techniques for global optimization in the COCONUT environment (Q2885482) (← links)
- Convex and concave relaxations of implicit functions (Q2943829) (← links)
- A two phase local global search algorithm using new global search strategy (Q3411890) (← links)
- On the convergence of adaptive partition algorithms in global optimization (Q3496164) (← links)
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure (Q3789345) (← links)
- A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential (Q4293262) (← links)
