Convex Maximization via Adjustable Robust Optimization
From MaRDI portal
Publication:5106408
DOI10.1287/ijoc.2021.1134OpenAlexW4213056486MaRDI QIDQ5106408
Aras Selvi, Dick den Hertog, Aharon Ben-Tal, Ruud C. M. Brekelmans
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.1134
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Bilinear modeling solution approach for fixed charge network flow problems
- Computing robust basestock levels
- Checking local optimality in constrained quadratic programming is NP- hard
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- On solving a d.c. programming problem by a sequence of linear programs
- A survey of adjustable robust optimization
- DC programming and DCA: thirty years of developments
- DC programming: overview.
- Variations and extension of the convex-concave procedure
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- .879-approximation algorithms for MAX CUT and MAX 2SAT
- Methods for Global Concave Minimization: A Bibliographic Survey
- Global Maximization of a Convex Function with Linear Inequality Constraints
- Adjustable Robust Optimization via Fourier–Motzkin Elimination
- Unsupervised classification via convex absolute value inequalities
- Essays and Surveys in Global Optimization
- Convex Analysis
- Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems
