Outer approximation for mixed-integer nonlinear robust optimization
From MaRDI portal
Publication:2095574
Recommendations
- Outer-approximation algorithms for nonsmooth convex MINLP problems
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- Exploiting structure in non-convex quadratic optimization and gas network planning under uncertainty
- A survey of nonlinear robust optimization
- Solving mixed integer nonlinear programs by outer approximation
Cites work
- A survey of nonlinear robust optimization
- Adaptive Bundle Methods for Nonlinear Robust Optimization
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Bundle method for non-convex minimization with inexact subgradients and function values
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- Deciding robust feasibility and infeasibility using a set containment approach: an application to stationary passive gas network operations
- Decomposable robust two-stage optimization: an application to gas network operations under uncertainty
- Deriving robust counterparts of nonlinear uncertain inequalities
- Evaluating Gas Network Capacities
- Exact methods for two-stage robust optimization with applications in gas networks
- Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 2196290 (Why is no real title available?)
- Inexact solution of NLP subproblems in MINLP
- 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 oracles with on-demand accuracy
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- Min-max and robust polynomial optimization
- Nonlinear optimization.
- Numerical Nonsmooth Optimization
- On solving generalized convex MINLP problems using supporting hyperplane techniques
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition
- On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
- On the quantification of nomination feasibility in stationary gas networks with random load
- Outer-approximation algorithms for nonsmooth convex MINLP problems
- Regularized optimization methods for convex MINLP problems
- Robust global optimization with polynomials
- Solving mixed integer nonlinear programs by outer approximation
- Using Piecewise Linear Functions for Solving MINLPs
- Using regularization and second order information in outer approximation for convex MINLP
- Validation of nominations in gas network optimization: models, methods, and solutions
Cited in
(9)- Solving mixed integer nonlinear programs by outer approximation
- Derivative-free robust optimization by outer approximations
- Radius of Robust Feasibility for Mixed-Integer Problems
- Adaptive Bundle Methods for Nonlinear Robust Optimization
- Optimization over decision trees: a case study for the design of stable direct-current electricity networks
- A mixed-integer approximation of robust optimization problems with mixed-integer adjustments
- A gradient-based method for joint chance-constrained optimization with continuous distributions
- A positive semidefinite safe approximation of multivariate distributionally robust constraints determined by simple functions
- Outer approximation for generalized convex mixed-integer nonlinear robust optimization problems
This page was built for publication: Outer approximation for mixed-integer nonlinear robust optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2095574)
