Pages that link to "Item:Q1063521"
From MaRDI portal
The following pages link to On outer approximation methods for solving concave minimization problems (Q1063521):
Displayed 22 items.
- On the global minimization of concave functions (Q800693) (← links)
- Convex programs with an additional reverse convex constraint (Q1071651) (← links)
- A note on the solution of bilinear programming problems by reduction to concave minimization (Q1102190) (← links)
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization (Q1102872) (← links)
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728) (← links)
- The design centering problem as a d.c. programming problem (Q1106730) (← links)
- On the global minimization of a convex function under general nonconvex constraints (Q1111474) (← links)
- Mathematical programs with a two-dimensional reverse convex constraint (Q1186268) (← links)
- On solving a d.c. programming problem by a sequence of linear programs (Q1186273) (← links)
- Primal-relaxed dual global optimization approach (Q1321372) (← links)
- Convex minimization under Lipschitz constraints (Q1823144) (← links)
- A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem (Q1890947) (← links)
- Dual approach to minimization on the set of Pareto-optimal solutions (Q1918295) (← links)
- Canonical DC programming problem: Outer approximation methods revisited (Q1919172) (← links)
- Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
- Variations and extension of the convex-concave procedure (Q2358020) (← links)
- D.c sets, d.c. functions and nonlinear equations (Q2367918) (← links)
- Concave minimization under linear constraints with special structure (Q3710317) (← links)
- Global optimization under Lipschitzian constraints (Q3760303) (← links)
- A modified version of Tuy's method for solving d.c. programing problem (Q3813618) (← links)
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection (Q5043850) (← links)
- Level function method for quasiconvex programming. (Q5929422) (← links)