Pages that link to "Item:Q757243"
From MaRDI portal
The following pages link to A branch and bound-outer approximation algorithm for concave minimization over a convex set (Q757243):
Displaying 36 items.
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
- On the global minimization of concave functions (Q800693) (← links)
- Concave minimization via conical partitions and polyhedral outer approximation (Q811411) (← links)
- Comparison of search strategies of branch and bound algorithm for concave minimization problems under linear constraints (Q934175) (← links)
- An outer approximation method for globally minimizing a concave function over a compact convex set (Q1057182) (← links)
- On outer approximation methods for solving concave minimization problems (Q1063521) (← links)
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization (Q1067978) (← 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)
- Method for minimizing a convex-concave function over a convex set (Q1176848) (← links)
- An all-linear programming relaxation algorithm for optimizing over the efficient set (Q1177916) (← 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)
- On nonconvex optimization problems with separated nonconvex variables (Q1187838) (← links)
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms (Q1304752) (← links)
- An outer approximation algorithm guaranteeing feasibility of solutions and approximate accuracy of optimality (Q1304754) (← links)
- A finite concave minimization algorithm using branch and bound and neighbor generation (Q1330802) (← links)
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
- A finite algorithm for global minimization of separable concave programs (Q1383840) (← links)
- Capacity planning in networks of queues with manufacturing applications (Q1900269) (← links)
- A new algorithm for minimizing convex functions over convex sets (Q1918926) (← links)
- An outcome space algorithm for minimizing the product of two convex functions over a convex set (Q1950065) (← links)
- A norm minimization-based convex vector optimization algorithm (Q2156397) (← links)
- A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems (Q2479840) (← links)
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems (Q2569195) (← links)
- On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
- Computational methods for solving nonconvex block-separable constrained quadratic problems (Q2810546) (← links)
- Performance of approximate algorithms for global minimization (Q3217953) (← links)
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application (Q3494393) (← links)
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set (Q3703662) (← links)
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization (Q3988952) (← links)
- On geometry and convergence of a class of simplicial covers (Q4327931) (← links)
- (Q5462190) (← links)
- An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set (Q5946143) (← links)
- Convergence analysis of a norm minimization-based convex vector optimization algorithm (Q6587338) (← links)
- Robust bilevel optimization for near-optimal lower-level solutions (Q6635807) (← links)