A decomposition method for MINLPs with Lipschitz continuous nonlinearities
From MaRDI portal
Publication:2330657
DOI10.1007/S10107-018-1309-XzbMATH Open1426.90053OpenAlexW2811083908WikidataQ129609931 ScholiaQ129609931MaRDI QIDQ2330657FDOQ2330657
Authors: Martin Schmidt, Mathias Sirvent, W. 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
Recommendations
- Linear decomposition approach for a class of nonconvex programming problems
- A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities
- On Decomposition Methods for a Class of Partially Separable Nonlinear Programs
- Publication:3468553
- scientific article; zbMATH DE number 3959143
- An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities
- A PRACTICAL APPROACH TO DECOMPOSABLE NONLINEAR PROGRAMMING PROBLEMS
- A decomposition method for convex minimization problems and its application.
- A Decomposition Method and Its Application to Convex Programming
- Decomposition in a non-linear programming problem with a non-convex constraint
decomposition methodsmixed integer nonlinear optimizationLipschitz optimizationgas networksinexact function evaluations
Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Nonlinear programming (90C30) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)
Cites Work
- AlphaECP
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Mixed-integer nonlinear optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partitioning procedures for solving mixed-variables programming problems
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Foundations of bilevel programming
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- The finite element methods and its reliability
- A posteriori error estimation in finite element analysis
- Relaxation methods for mixed-integer optimal control of partial differential equations
- Title not available (Why is that?)
- An algorithmic framework for convex mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- A polyhedral branch-and-cut approach to global optimization
- Generalized Benders decomposition
- Stationary states in gas networks
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Title not available (Why is that?)
- Bilevel programming problems. Theory, algorithms and applications to energy networks
- An optimal control approach to a posteriori error estimation in finite element methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Title not available (Why is that?)
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- 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
- Title not available (Why is that?)
- Lipschitz global optimization methods in control problems
- Differential properties of the marginal function in mathematical programming
- Using Piecewise Linear Functions for Solving MINLPs
- A New Algorithm for MINLP Applied to Gas Transport Energy Cost Minimization
- Validation of nominations in gas network optimization: models, methods, and solutions
- Bilevel programming and price setting problems
- An algorithm for finding the absolute extremum of a function
- The MILP-relaxation approach
- Inexact solution of NLP subproblems in MINLP
- Evaluating Gas Network Capacities
- Combinatorial integral approximation
- Nonlinear optimization with GAMS /LGO
- Numerical methods for finding global extrema (Case of a non-uniform mesh)
- 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 algorithms for solving global optimization problems with Lipschitzian structure
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- Title not available (Why is that?)
- On the convergence of global methods in multiextremal optimization
- Globally convergent methods for n-dimensional multiextremal optimization
- High detail stationary optimization models for gas networks
- Extended univariate algorithms for \(n\)-dimensional global optimization
- Global optimization on convex sets
- Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
- Towards simulation based mixed‐integer optimization with differential equations
- On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
- Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes
- Uniqueness of market equilibrium on a network: a peak-load pricing approach
- High detail stationary optimization models for gas networks: validation and results
- The precise NLP model
- Networks of pipelines for gas with nonconstant compressibility factor: stationary states
- Solving highly detailed gas transport MINLPs: block separability and penalty alternating direction methods
- Title not available (Why is that?)
- Partial outer convexification for traffic light optimization in road networks
- Relaxation methods for hyperbolic PDE mixed-integer optimal control problems
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- A posteriori error estimation in PDE-constrained optimization with pointwise inequality constraints
Cited In (5)
- The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities
- A multilevel model of the European entry-exit gas market
- Global optimization of mixed-integer ODE constrained network problems using the example of stationary gas transport
- A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities
- Using neural networks to solve linear bilevel problems with unknown lower level
Uses Software
This page was built for publication: A decomposition method for MINLPs with Lipschitz continuous nonlinearities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2330657)
