A decomposition method for MINLPs with Lipschitz continuous nonlinearities
From MaRDI portal
Publication:2330657
DOI10.1007/s10107-018-1309-xzbMath1426.90053OpenAlexW2811083908WikidataQ129609931 ScholiaQ129609931MaRDI QIDQ2330657
Martin Schmidt, Mathias Sirvent, Winnifried Wollner
Publication date: 22 October 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-018-1309-x
Lipschitz optimizationdecomposition methodsmixed integer nonlinear optimizationgas networksinexact function evaluations
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Nonlinear programming (90C30) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items
The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities ⋮ A multilevel model of the European entry-exit gas market ⋮ A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities ⋮ Using neural networks to solve linear bilevel problems with unknown lower level ⋮ Global Optimization of Mixed-Integer ODE Constrained Network Problems Using the Example of Stationary Gas Transport
Uses Software
Cites Work
- AlphaECP
- Stationary states in gas networks
- Relaxation methods for mixed-integer optimal control of partial differential equations
- Lipschitz global optimization methods in control problems
- Combinatorial integral approximation
- Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes
- Networks of pipelines for gas with nonconstant compressibility factor: stationary states
- An algorithmic framework for convex mixed integer nonlinear programs
- Extended univariate algorithms for \(n\)-dimensional global optimization
- On the convergence of global methods in multiextremal optimization
- Global optimization on convex sets
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- Partitioning procedures for solving mixed-variables programming problems
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- Foundations of bilevel programming
- Uniqueness of market equilibrium on a network: a peak-load pricing approach
- A polyhedral branch-and-cut approach to global optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Inexact solution of NLP subproblems in MINLP
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- High detail stationary optimization models for gas networks
- High detail stationary optimization models for gas networks: validation and results
- Nonlinear optimization with GAMS /LGO
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Generalized Benders decomposition
- Using Piecewise Linear Functions for Solving MINLPs
- Evaluating Gas Network Capacities
- Validation of nominations in gas network optimization: models, methods, and solutions
- A Posteriori Error Estimation in PDE-constrained Optimization with Pointwise Inequality Constraints
- Partial Outer Convexification for Traffic Light Optimization in Road Networks
- An optimal control approach to a posteriori error estimation in finite element methods
- Globally convergent methods for n-dimensional multiextremal optimization
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- Differential properties of the marginal function in mathematical programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
- Relaxation methods for hyperbolic PDE mixed‐integer optimal control problems
- Towards simulation based mixed‐integer optimization with differential equations
- An algorithm for finding the absolute extremum of a function
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods
- Bilevel Programming Problems
- A New Algorithm for MINLP Applied to Gas Transport Energy Cost Minimization
- Mixed-integer nonlinear optimization
- Numerical methods for finding global extrema (Case of a non-uniform mesh)
- Chapter 6: The MILP-relaxation approach
- Chapter 10: The precise NLP model
- Bilevel programming and price setting problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A decomposition method for MINLPs with Lipschitz continuous nonlinearities
