4.5 Article

On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm

Related references

Note: Only part of the references are listed.
Review Engineering, Multidisciplinary

A review and comparison of solvers for convex MINLP

Jan Kronqvist et al.

OPTIMIZATION AND ENGINEERING (2019)

Article Engineering, Electrical & Electronic

An Exact Solution Method for the Hydrothermal Unit Commitment Under Wind Power Uncertainty With Joint Probability Constraints

Wim van Ackooij et al.

IEEE TRANSACTIONS ON POWER SYSTEMS (2018)

Article Operations Research & Management Science

On solving generalized convex MINLP problems using supporting hyperplane techniques

Tapio Westerlund et al.

JOURNAL OF GLOBAL OPTIMIZATION (2018)

Article Operations Research & Management Science

Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems

Ville-Pekka Eronen et al.

JOURNAL OF GLOBAL OPTIMIZATION (2017)

Article Operations Research & Management Science

Optimality conditions in optimization problems with convex feasible set using convexificators

Alireza Kabgani et al.

MATHEMATICAL METHODS OF OPERATIONS RESEARCH (2017)

Article Operations Research & Management Science

The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming

Jan Kronqvist et al.

JOURNAL OF GLOBAL OPTIMIZATION (2016)

Article Operations Research & Management Science

Convexity and optimization with copulae structured probabilistic constraints

W. van Ackooij et al.

OPTIMIZATION (2016)

Article Operations Research & Management Science

Regularized optimization methods for convex MINLP problems

Welington de Oliveira

Article Operations Research & Management Science

Convex mixed integer nonlinear programming problems and an outer approximation algorithm

Zhou Wei et al.

JOURNAL OF GLOBAL OPTIMIZATION (2015)

Article Operations Research & Management Science

Outer Approximation Algorithm for One Class of Convex Mixed-Integer Nonlinear Programming Problems with Partial Differentiability

Zhou Wei et al.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2015)

Article Mathematics, Applied

GENERALIZED BENDERS DECOMPOSITION FOR ONE CLASS OF MINLPs WITH VECTOR CONIC CONSTRAINT

Zhou Wei et al.

SIAM JOURNAL ON OPTIMIZATION (2015)

Article Operations Research & Management Science

Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems

Ville-Pekka Eronen et al.

OPTIMIZATION (2015)

Article Operations Research & Management Science

Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints

Juan Enrique Martinez-Legaz

OPTIMIZATION LETTERS (2015)

Article Operations Research & Management Science

On the generalization of ECP and OA methods to nonsmooth convex MINLP problems

Ville-Pekka Eronen et al.

OPTIMIZATION (2014)

Article Engineering, Multidisciplinary

Joint chance constrained programming for hydro reservoir management

Wim van Ackooij et al.

OPTIMIZATION AND ENGINEERING (2014)

Correction Operations Research & Management Science

On convex optimization without convex representation (vol 5, pg 549, 2011)

Jean B. Lasserre

OPTIMIZATION LETTERS (2014)

Article Operations Research & Management Science

Optimality conditions in convex optimization revisited

Joydeep Dutta et al.

OPTIMIZATION LETTERS (2013)

Article Operations Research & Management Science

On convex optimization without convex representation

Jean B. Lasserre

OPTIMIZATION LETTERS (2011)

Article Operations Research & Management Science

On representations of the feasible set in convex optimization

Jean Bernard Lasserre

OPTIMIZATION LETTERS (2010)

Article Computer Science, Software Engineering

Branching and bounds tightening techniques for non-convex MINLP

Pietro Belotti et al.

OPTIMIZATION METHODS & SOFTWARE (2009)