Pages that link to "Item:Q1099780"
From MaRDI portal
The following pages link to Constrained global optimization: algorithms and applications (Q1099780):
Displaying 50 items.
- Global minimization of indefinite quadratic problems (Q1092620) (← links)
- Quadratic problems defined on a convex hull of points (Q1102708) (← links)
- Checking local optimality in constrained quadratic programming is NP- hard (Q1102861) (← links)
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728) (← links)
- Parallel search algorithms in global optimization (Q1114315) (← links)
- A parallel algorithm for constrained concave quadratic global minimization (Q1116888) (← links)
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems (Q1122325) (← links)
- Special cases of the quadratic assignment problem (Q1129914) (← links)
- Dual quadratic estimates in polynomial and Boolean programming (Q1173717) (← links)
- The interactive fixed charge inhomogeneous flows optimization problem (Q1173721) (← links)
- Method for minimizing a convex-concave function over a convex set (Q1176848) (← links)
- Quadratic programming with one negative eigenvalue is NP-hard (Q1177910) (← links)
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems (Q1177915) (← links)
- An all-linear programming relaxation algorithm for optimizing over the efficient set (Q1177916) (← links)
- An algorithm for indefinite quadratic programming with convex constraints (Q1180839) (← links)
- An interior point algorithm to solve computationally difficult set covering problems (Q1181917) (← links)
- A computational analysis of LCP methods for bilinear and concave quadratic programming (Q1184453) (← 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)
- Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← 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)
- Unconstrained 0-1 nonlinear programming: A nondifferentiable approach (Q1187840) (← links)
- On affine scaling algorithms for nonconvex quadratic programming (Q1196182) (← links)
- Convergence qualification of adaptive partition algorithms in global optimization (Q1196187) (← links)
- An application of Lipschitzian global optimization to product design (Q1200528) (← links)
- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem (Q1200636) (← links)
- A parametric successive underestimation method for convex multiplicative programming problems (Q1200637) (← links)
- Dual estimates in multiextremal problems (Q1201906) (← links)
- Generating quadratic assignment test problems with known optimal permutations (Q1203071) (← links)
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case (Q1207046) (← links)
- Linear multiplicative programming (Q1207311) (← links)
- Nonlinear programming for multiperiod capacity planning in a manufacturing system (Q1278476) (← links)
- Modified \(r\)-algorithm to find the global minimum of polynomial functions (Q1280905) (← links)
- An approximate approach of global optimization for polynomial programming problems (Q1296128) (← links)
- Handbook of test problems in local and global optimization (Q1304172) (← links)
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure (Q1306360) (← links)
- Parallel computing in nonconvex programming (Q1309859) (← links)
- A remark on the GOP algorithm for global optimization (Q1310984) (← links)
- Isotropic effective energy simulated annealing searches for low energy molecular cluster states (Q1312089) (← links)
- A new technique for generating quadratic programming test problems (Q1315416) (← links)
- A finite algorithm for solving general quadratic problems (Q1315437) (← links)
- Global minimization of a generalized convex multiplicative function (Q1315440) (← links)
- The maximum clique problem (Q1318271) (← links)
- Optimization methods for computing global minima of nonconvex potential energy functions (Q1319002) (← 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)
- Primal-relaxed dual global optimization approach (Q1321372) (← links)
- Optimization over the efficient set: Four special cases (Q1321439) (← links)
