On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm
From MaRDI portal
Publication:2200088
DOI10.1007/s10898-020-00906-yzbMath1450.90050arXiv1905.08157OpenAlexW2944947738MaRDI QIDQ2200088
Felipe Serrano, Ambros M. Gleixner, Robert Schwarz
Publication date: 15 September 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.08157
Related Items
A disjunctive cut strengthening technique for convex MINLP ⋮ Using projected cutting planes in the extended cutting plane method ⋮ Maximal quadratic-free sets
Uses Software
Cites Work
- Erratum to: ``On convex optimization without convex representation
- Regularized optimization methods for convex MINLP problems
- On convex optimization without convex representation
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- Lower subdifferentiable functions and their minimization by cutting planes
- On representations of the feasible set in convex optimization
- Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Solving mixed integer nonlinear programs by outer approximation
- On solving generalized convex MINLP problems using supporting hyperplane techniques
- Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems
- Optimality conditions in convex optimization revisited
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Joint chance constrained programming for hydro reservoir management
- Optimality conditions in optimization problems with convex feasible set using convexificators
- Generalized Benders decomposition
- Convexity and optimization with copulæ structured probabilistic constraints
- Introduction to Piecewise Differentiable Equations
- Introduction to Nonsmooth Optimization
- Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint
- Outline of an algorithm for integer solutions to linear programs
- The Cutting-Plane Method for Solving Convex Programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- An introduction to the theory of nonsmooth optimization
- Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems
- On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
- The Supporting Hyperplane Method for Unimodal Programming
- Convex Analysis
- Convex analysis and global optimization
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
