A new dual-based cutting plane algorithm for nonlinear adjustable robust optimization
From MaRDI portal
Publication:6568949
DOI10.1007/s10898-023-01360-2MaRDI QIDQ6568949
Abbas Khademi, Ahmadreza Marandi, Majid Soleimani-damaneh
Publication date: 8 July 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
biconvex programmingFenchel dualityalternating methodadjustable robust optimizationcutting plane methodsperspective function
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Robustness in mathematical programming (90C17)
Cites Work
- Unnamed Item
- Unnamed Item
- On the power and limitations of affine policies in two-stage adaptive optimization
- Robust portfolio optimization: a categorized bibliographic review
- Adjustable robust counterpart of conic quadratic problems
- Robust solutions of uncertain linear programs
- Adjustable robust solutions of uncertain linear programs
- Perspective functions: properties, constructions, and examples
- When are static and adjustable robust optimization problems with constraint-wise uncertainty equivalent?
- A survey of adjustable robust optimization
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- A two-stage robust model for a reliable \(p\)-center facility location problem
- Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules
- Saddle point approximation approaches for two-stage robust optimization problems
- Ideal formulations for constrained convex optimization problems with indicator variables
- Gaining or losing perspective
- LR-NIMBUS: an interactive algorithm for uncertain multiobjective optimization with lightly robust efficient solutions
- \(K\)-adaptability in two-stage mixed-integer robust optimization
- A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Adjustable robust optimization models for a nonlinear two-period system
- Managing reliable emergency logistics for hazardous materials: a two-stage robust optimization approach
- Robust Convex Optimization
- Multistage Robust Mixed-Integer Optimization with Adaptive Partitions
- Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set
- K-Adaptability in Two-Stage Robust Binary Programming
- Robust Solutions to Uncertain Semidefinite Programs
- First-Order Methods in Optimization
- Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios
- Piecewise Constant Decision Rules via Branch-and-Bound Based Scenario Detection for Integer Adjustable Robust Optimization
- Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems
- Lectures on Stochastic Programming: Modeling and Theory, Third Edition
- A Hierarchy of Near-Optimal Policies for Multistage Adaptive Optimization
- Convex Analysis
- Note—A Note on the Cyclic Coordinate Ascent Method
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Introduction to Nonlinear Optimization: Theory, Algorithms, and Applications with Python and MATLAB, Second Edition
This page was built for publication: A new dual-based cutting plane algorithm for nonlinear adjustable robust optimization