Adaptive Bundle Methods for Nonlinear Robust Optimization
From MaRDI portal
Recommendations
- Outer approximation for mixed-integer nonlinear robust optimization
- A survey of nonlinear robust optimization
- General robust-optimization formulation for nonlinear programming
- Nonconvex robust optimization for problems with constraints
- Exact methods for two-stage robust optimization with applications in gas networks
Cites work
- A bundle-Newton method for nonsmooth unconstrained minimization
- A partially inexact bundle method for convex semi-infinite minmax problems
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- A proximity control algorithm to minimize nonsmooth and nonconvex functions
- A proximity control algorithm to minimize nonsmooth and nonconvex semi-infinite maximum eigenvalue functions
- A redistributed proximal bundle method for nonconvex optimization
- A survey of nonlinear robust optimization
- A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- An aggregate subgradient method for nonsmooth convex minimization
- An Algorithm for Nonsmooth Convex Minimization With Errors
- An approximation technique for robust nonlinear optimization
- An Incremental Method for Solving Convex Finite Min-Max Problems
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
- Approximate convexity and submonotonicity.
- Bundle method for non-convex minimization with inexact subgradients and function values
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Cutting plane oracles to minimize non-smooth non-convex functions
- Decomposable robust two-stage optimization: an application to gas network operations under uncertainty
- Derivative-free robust optimization by outer approximations
- Deriving robust counterparts of nonlinear uncertain inequalities
- Design of a flight control architecture using a non-convex bundle method
- Differential properties of the marginal function in mathematical programming
- Evaluating Gas Network Capacities
- Generalized Gradients and Applications
- How to solve a semi-infinite optimization problem
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 51950 (Why is no real title available?)
- scientific article; zbMATH DE number 1529036 (Why is no real title available?)
- scientific article; zbMATH DE number 3805870 (Why is no real title available?)
- scientific article; zbMATH DE number 1834580 (Why is no real title available?)
- Mathematical programming formulations for the alternating current optimal power flow problem
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
- Nonlinear robust optimization via sequential convex bilevel programming
- On the quantification of nomination feasibility in stationary gas networks with random load
- On the Solution of Discrete Programming Problems
- Robust optimization
- Robust Optimization for Electricity Generation
- Semi-infinite programming and applications to minimax problems
- Solving minimax problems by interval methods
- Solving the Pipe Network Analysis Problem Using Optimization Techniques
- Submonotone Subdifferentials of Lipschitz Functions
- Survey of Bundle Methods for Nonsmooth Optimization
- The effect of deterministic noise in subgradient methods
- Uncontrolled inexact information within bundle methods
- Using Piecewise Linear Functions for Solving MINLPs
- Validation of nominations in gas network optimization: models, methods, and solutions
- ε-Subdifferential and ε-monotonicity
Cited in
(9)- Outer approximation for mixed-integer nonlinear robust optimization
- An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization
- A gradient-based method for joint chance-constrained optimization with continuous distributions
- An inexact bundle method for semi-infinite minimax problems
- 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
- On a Frank-Wolfe approach for abs-smooth functions
- Adjustable robust nonlinear network design without controllable elements under load scenario uncertainties
- Gradient sampling algorithm for subsmooth functions
This page was built for publication: Adaptive Bundle Methods for Nonlinear Robust Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5106409)
