Derivative-free robust optimization by outer approximations

We develop an algorithm for minimax problems that arise in robust optimization in the absence of objective function derivatives. The algorithm utilizes an extension of methods for inexact outer approximation in sampling a potentially infinite-cardinality uncertainty set. Clarke stationarity of the algorithm output is established alongside desirable features of the model-based trust-region subproblems encountered. We demonstrate the practical benefits of the algorithm on a new class of test problems.

[1]  Warren Hare,et al.  A derivative-free approximate gradient sampling algorithm for finite minimax problems , 2013, Computational Optimization and Applications.

[2]  Stefan M. Wild,et al.  Manifold Sampling for ℓ1 Nonconvex Optimization , 2016, SIAM J. Optim..

[3]  Dimitris Bertsimas,et al.  Robust optimization with simulated annealing , 2010, J. Glob. Optim..

[4]  Iain Dunning,et al.  Reformulation versus cutting-planes for robust optimization , 2015, Comput. Manag. Sci..

[5]  R. Steele.  Optimization , 2005 .

[6]  Christine A. Shoemaker,et al.  Global Convergence of Radial Basis Function Trust-Region Algorithms for Derivative-Free Optimization , 2013, SIAM Rev..

[7]  Andreas Griewank,et al.  Evaluating derivatives - principles and techniques of algorithmic differentiation, Second Edition , 2000, Frontiers in applied mathematics.

[8]  Giuseppe Carlo Calafiore,et al.  Uncertain convex programs: randomized solutions and confidence levels , 2005, Math. Program..

[9]  Sven Leyffer,et al.  Solving mixed integer nonlinear programs by outer approximation , 1994, Math. Program..

[10]  Stefan M. Wild,et al.  Manifold Sampling for Nonconvex Optimization of Piecewise Linear Compositions , 2017 .

[11]  Stefano Lucidi,et al.  Derivative-Free Robust Optimization for Circuit Design , 2015, J. Optim. Theory Appl..

[12]  Stefan M. Wild,et al.  Benchmarking Derivative-Free Optimization Algorithms , 2009, SIAM J. Optim..

[13]  Moritz Diehl,et al.  An approximation technique for robust nonlinear optimization , 2006, Math. Program..

[14]  Ignacio E. Grossmann,et al.  An outer-approximation algorithm for a class of mixed-integer nonlinear programs , 1987, Math. Program..

[15]  Constantine Caramanis,et al.  Theory and Applications of Robust Optimization , 2010, SIAM Rev..

[16]  Katya Scheinberg,et al.  Introduction to derivative-free optimization , 2010, Math. Comput..

[17]  Stefan M. Wild,et al.  Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components , 2018, SIAM J. Optim..

[18]  Warren Hare,et al.  Configuration optimization of dampers for adjacent buildings under seismic excitations , 2012 .

[19]  Shie Mannor,et al.  Oracle-Based Robust Optimization via Online Learning , 2014, Oper. Res..

[20]  Ya-Xiang Yuan,et al.  A derivative-free trust-region algorithm for composite nonsmooth optimization , 2014, Computational and Applied Mathematics.

[21]  C. C. Gonzaga,et al.  On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms , 1979 .

[22]  K. Kiwiel.  An ellipsoid trust region bundle method for nonsmooth convex minimization , 1989 .

[23]  K. M. Teo,et al.  Robust optimization in electromagnetic scattering problems , 2007 .

[24]  Warren Hare,et al.  A Redistributed Proximal Bundle Method for Nonconvex Optimization , 2010, SIAM J. Optim..

[25]  Andrew R. Conn,et al.  Bilevel derivative-free optimization and its application to robust optimization , 2012, Optim. Methods Softw..

[26]  Bertrand Melenberg,et al.  Computationally Tractable Counterparts of Distributionally Robust Constraints on Risk Measures , 2014, SIAM Rev..

[27]  Jean-Philippe Vial,et al.  Deriving robust counterparts of nonlinear uncertain inequalities , 2012, Math. Program..

[28]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[29]  Frank E. Curtis,et al.  An adaptive gradient sampling algorithm for non-smooth optimization , 2013, Optim. Methods Softw..

[30]  W. Hare,et al.  Compositions of convex functions and fully linear models , 2016, Optim. Lett..

[31]  Luís Nunes Vicente,et al.  Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case , 2016, SIAM J. Optim..

[32]  Nicholas I. M. Gould,et al.  Trust Region Methods , 2000, MOS-SIAM Series on Optimization.

[33]  Kenneth O. Kortanek,et al.  Semi-Infinite Programming: Theory, Methods, and Applications , 1993, SIAM Rev..

[34]  A. A. Goldstein,et al.  Newton's method for convex programming and Tchebycheff approximation , 1959, Numerische Mathematik.

[35]  Christine A. Shoemaker,et al.  ORBIT: Optimization by Radial Basis Function Interpolation in Trust-Regions , 2008, SIAM J. Sci. Comput..

[36]  Andreas Griewank,et al.  Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization , 2018, Optim. Methods Softw..

[37]  Donald Goldfarb,et al.  Robust convex quadratically constrained programs , 2003, Math. Program..

[38]  Laurent El Ghaoui,et al.  Robust Optimization , 2021, ICORES.

[39]  Dimitris Bertsimas,et al.  Robust Optimization for Unconstrained Simulation-Based Problems , 2010, Oper. Res..

[40]  Warren Hare,et al.  Computing proximal points of nonconvex functions , 2008, Math. Program..