The Supporting Hyperplane Method for Unimodal Programming
From MaRDI portal
Cited in
(51)- On cutoff optimization methods in infinite-dimensional spaces and applications
- Some outer approximation methods for semi-infinite optimization problems
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- Algorithms for non-convexS n -games
- Reformulating the disjunctive cut generating linear program
- A discussion of probability functions and constraints from a variational perspective
- Using projected cutting planes in the extended cutting plane method
- A polyhedral approximation algorithm for recession cones of spectrahedral shadows
- An iterative procedure for collapse analysis of reinforced concrete plates
- Level bundle methods for constrained convex optimization with various oracles
- Solving a large scale semi-definite logit model
- Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment
- Outer approximation by polyhedral convex sets
- The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
- Polyhedral approximation of spectrahedral shadows via homogenization
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm
- Convexity and optimization with copulæ structured probabilistic constraints
- ALGORITHMS FOR OPTIMIZATION OF POWER SYSTEMS SCHEDULES BASED ON THE SIMPLEX METHOD
- Lower subdifferentiable functions and their minimization by cutting planes
- Deletion-by-infeasibility rule for DC-constrained global optimization
- On the global minimization of concave functions
- Stochastic programming in water management: A case study and a comparison of solution techniques
- The geometry of monotone operator splitting methods
- Global optimization of mixed-integer nonlinear programs with SCIP 8
- Global optimization on convex sets
- A two-stage cutting-plane method for conditional minimizing function
- On the convergence of a class of outer approximation algorithms for convex programs
- A maximization method for a class of quasiconcave programs
- On the approximation of unbounded convex sets by polyhedra
- Minimization methods with constraints
- A disjunctive cut strengthening technique for convex MINLP
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
- A central cutting plane algorithm for the convex programming problem
- Solving variational inequalities defined on a domain with infinitely many linear constraints
- On solving generalized convex MINLP problems using supporting hyperplane techniques
- Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems
- Ein heuristisches Verfahren zur globalen Optimierung
- Canonical DC programming problem: Outer approximation methods revisited
- Methods of embedding-cutting off in problems of mathematical programming
- Joint chance constrained programming for hydro reservoir management
- A cutting-plane algorithm with linear and geometric rates of convergence
- Computational aspects of cutting-plane algorithms for geometric programming problems
- D.C. representability of closed sets in reflexive Banach spaces and applications to optimization problems
- On an outer approximation concept in global optimization
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- Robustness of systems with uncertainties in the input
- A constraint generation algorithm for large scale linear programs using multiple-points separation
- Approximating data in \({\mathbb R}^{n}\) by a quadratic underestimator with specified Hessian minimum and maximum eigenvalues
- Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
This page was built for publication: The Supporting Hyperplane Method for Unimodal Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5525794)