Outer-approximation algorithms for nonsmooth convex MINLP problems
From MaRDI portal
Recommendations
- An outer approximation method for a class of minimax convex MINLP problems
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition
- Solving mixed integer nonlinear programs by outer approximation
Cites work
- A comparison of four approaches from stochastic programming for large-scale unit-commitment
- A doubly stabilized bundle method for nonsmooth convex optimization
- A joint model of probabilistic/robust constraints for gas transport management in stationary networks
- A primal-proximal heuristic applied to the French unit-commitment problem
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- An algorithmic framework for convex mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Benchmarking optimization software with performance profiles.
- Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Generalized Benders decomposition
- Generalized Bundle Methods
- scientific article; zbMATH DE number 3466447 (Why is no real title available?)
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- Introduction to nonsmooth optimization. Theory, practice and software
- Level bundle methods for constrained convex optimization with various oracles
- Mixed-integer nonlinear optimization
- Nonlinear integer programming
- Nonlinear optimization.
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
- Partitioning procedures for solving mixed-variables programming problems
- Regularized optimization methods for convex MINLP problems
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Solving mixed integer nonlinear programs by outer approximation
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- The Cutting-Plane Method for Solving Convex Programs
- Theory and applications of robust optimization
Cited in
(11)- Convergent outer approximation algorithms for solving unary programs
- A proximal-point outer approximation algorithm
- Alternative regularizations for outer-approximation algorithms for convex MINLP
- Outer approximation for mixed-integer nonlinear robust optimization
- Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition
- An outer approximation method for a class of minimax convex MINLP problems
- On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
- 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
This page was built for publication: Outer-approximation algorithms for nonsmooth convex MINLP problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5745165)
