On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
From MaRDI portal
Recommendations
- Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems
- Outer-approximation algorithms for nonsmooth convex MINLP problems
- Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition
Cites work
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- An Efficient Method to Solve the Minimax Problem Directly
- An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Non-Euclidean restricted memory level method for large-scale convex optimization
- Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
- Proximity control in bundle methods for convex nondifferentiable minimization
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Solving mixed integer nonlinear programs by outer approximation
- Survey of Bundle Methods for Nonsmooth Optimization
- The Cutting-Plane Method for Solving Convex Programs
- Variants to the cutting plane approach for convex nondifferentiable optimization
Cited in
(20)- On solving generalized convex MINLP problems using supporting hyperplane techniques
- Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems
- Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks
- Partially distributed outer approximation
- Outer approximation for mixed-integer nonlinear robust optimization
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition
- Two linear approximation algorithms for convex mixed integer nonlinear programming
- Generalized Benders decomposition for one class of MINLPs with vector conic constraint
- Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems
- Using projected cutting planes in the extended cutting plane method
- Regularized optimization methods for convex MINLP problems
- Outer-approximation algorithms for nonsmooth convex MINLP problems
- A bilevel approach for identifying the worst contingencies for nonconvex alternating current power systems
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- Outer approximation for pseudo-convex mixed-integer nonlinear program problems
- Outer approximation for generalized convex mixed-integer nonlinear robust optimization problems
- 50 years of mixed-integer nonlinear and disjunctive programming
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability
This page was built for publication: On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495574)
