On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
From MaRDI portal
(Redirected from Publication:1102872)
Recommendations
Cites work
- A Successive Underestimation Method for Concave Minimization Problems
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- A method for globally minimizing concave functions over convex sets
- An outer approximation method for globally minimizing a concave function over a compact convex set
- On an outer approximation concept in global optimization
- On outer approximation methods for solving concave minimization problems
Cited in
(44)- A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
- ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS
- A quasiconcave minimization method for solving linear two-level programs
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
- On global optimality conditions and cutting plane algorithms
- An algorithm for solving general D. C. programming problems
- Branch-and-bound decomposition approach for solving quasiconvex-concave programs
- DC programming: overview.
- A modified version of Tuy's method for solving d.c. programing problem
- An exact solution method for reliability optimization in complex systems
- Bisecton by global optimization revisited
- Canonical DC programming problem: Outer approximation methods revisited
- On-line and off-line vertex enumeration by adjacency lists
- scientific article; zbMATH DE number 7312765 (Why is no real title available?)
- A new simplicial cover technique in constrained global optimization
- Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization
- On solving a d.c. programming problem by a sequence of linear programs
- Selected bibliography on degeneracy
- An analytical approach to global optimization
- scientific article; zbMATH DE number 3918105 (Why is no real title available?)
- A decomposition method for the min concave cost flow problem with a staircase structure
- A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- An algorithm for solving convex programs with an additional convex- concave constraint
- A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure
- A partial cooperation model for non-unique linear two-level decision problems
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- An algorithm for a concave production cost network flow problem
- Separable concave minimization via partial outer approximation and branch and bound
- An efficient solution method for rank two quasiconcave minimization problems
- A global optimization approach for solving the convex multiplicative programming problem
- Decomposition approach for the global minimization of biconcave functions over polytopes
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
- Concave minimization via conical partitions and polyhedral outer approximation
- An algorithm for indefinite quadratic programming with convex constraints
- The polyhedral-surface cutting plane method of optimization over a vertex-located set
- On the minimization of a quasi-concave function subject to linear constraints
- Convex minimization under Lipschitz constraints
- D.c sets, d.c. functions and nonlinear equations
- The complementary convex structure in global optimization
- A global optimization approach for the linear two-level program
- An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming
- Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
- Polyhedral annexation, dualization and dimension reduction technique in global optimization
This page was built for publication: On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102872)
