Adaptive Bundle Methods for Nonlinear Robust Optimization
From MaRDI portal
Publication:5106409
DOI10.1287/ijoc.2021.1122OpenAlexW4220793708MaRDI QIDQ5106409
Michael Stingl, Frauke Liers, Martina Kuchlbauer
Publication date: 19 September 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2021.1122
Related Items
An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization, Outer approximation for mixed-integer nonlinear robust optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the quantification of nomination feasibility in stationary gas networks with random load
- Design of a flight control architecture using a non-convex bundle method
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Cutting plane oracles to minimize non-smooth non-convex functions
- A partially inexact bundle method for convex semi-infinite minmax problems
- A bundle-Newton method for nonsmooth unconstrained minimization
- Semi-infinite programming and applications to minimax problems
- Approximate convexity and submonotonicity.
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
- The effect of deterministic noise in subgradient methods
- How to solve a semi-infinite optimization problem
- Derivative-free robust optimization by outer approximations
- Uncontrolled inexact information within bundle methods
- Nonlinear robust optimization via sequential convex bilevel programming
- An approximation technique for robust nonlinear optimization
- Deriving robust counterparts of nonlinear uncertain inequalities
- Solving minimax problems by interval methods
- Using Piecewise Linear Functions for Solving MINLPs
- Evaluating Gas Network Capacities
- Validation of nominations in gas network optimization: models, methods, and solutions
- An aggregate subgradient method for nonsmooth convex minimization
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- On the Solution of Discrete Programming Problems
- A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
- An Algorithm for Nonsmooth Convex Minimization With Errors
- Submonotone Subdifferentials of Lipschitz Functions
- Differential properties of the marginal function in mathematical programming
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Generalized Gradients and Applications
- Solving the Pipe Network Analysis Problem Using Optimization Techniques
- ε-Subdifferential and ε-monotonicity
- Survey of Bundle Methods for Nonsmooth Optimization
- Robust Optimization for Electricity Generation
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
- Decomposable robust two‐stage optimization: An application to gas network operations under uncertainty
- An Incremental Method for Solving Convex Finite Min-Max Problems
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values
- A survey of nonlinear robust optimization
- Mathematical programming formulations for the alternating current optimal power flow problem
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
