| Publication | Date of Publication | Type |
|---|
| Minkowski centers via robust optimization: computation and applications | 2024-12-20 | Paper |
| Finding regions of counterfactual explanations via robust optimization | 2024-11-20 | Paper |
| Optimization with constraint learning: a framework and survey | 2024-04-16 | Paper |
| Pareto adaptive robust optimality via a Fourier-Motzkin elimination lens | 2024-04-09 | Paper |
| Technical Note—Dual Approach for Two-Stage Robust Nonlinear Optimization | 2024-03-12 | Paper |
| Robust convex optimization: a new perspective that unifies and extends | 2023-06-23 | Paper |
| A reformulation-linearization technique for optimization over simplices | 2023-03-14 | Paper |
| Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective | 2022-12-01 | Paper |
| Convex Maximization via Adjustable Robust Optimization | 2022-09-19 | Paper |
| MAD Dispersion Measure Makes Extremal Queue Analysis Simple | 2022-07-01 | Paper |
| Robust Optimization for Models with Uncertain Second-Order Cone and Semidefinite Programming Constraints | 2022-06-28 | Paper |
| Extending the Scope of Robust Quadratic Optimization | 2022-06-28 | Paper |
| Tight tail probability bounds for distribution-free decision making | 2022-03-11 | Paper |
| Probabilistic Guarantees in Robust Optimization | 2021-12-01 | Paper |
| A distributionally robust analysis of the program evaluation and review technique | 2021-06-07 | Paper |
| Reducing Conservatism in Robust Optimization | 2021-02-01 | Paper |
| Improving Tractability of Real-Time Control Schemes via Simplified $\mathcal{S}$-Lemma | 2020-12-08 | Paper |
| Robust Optimization of Dose-Volume Metrics for Prostate HDR-Brachytherapy Incorporating Target and OAR Volume Delineation Uncertainties | 2020-12-02 | Paper |
| Computing the Maximum Volume Inscribed Ellipsoid of a Polytopic Projection | 2020-11-09 | Paper |
| Robust Optimization with Ambiguous Stochastic Constraints Under Mean and Dispersion Information | 2020-10-12 | Paper |
| Adjustable Robust Optimization via Fourier–Motzkin Elimination | 2020-10-12 | Paper |
| A survey of adjustable robust optimization | 2019-04-30 | Paper |
| An approximation framework for two-stage ambiguous stochastic integer programs under mean-MAD information | 2018-12-18 | Paper |
| Robust optimization of uncertain multistage inventory systems with inexact data in decision rules | 2018-10-10 | Paper |
| Centered solutions for uncertain linear equations | 2018-10-10 | Paper |
| When are static and adjustable robust optimization problems with constraint-wise uncertainty equivalent? | 2018-08-22 | Paper |
| Globalized Robust Optimization for Nonlinear Uncertain Inequalities | 2017-10-04 | Paper |
| The impact of the existence of multiple adjustable robust solutions | 2016-11-25 | Paper |
| Computationally Tractable Counterparts of Distributionally Robust Constraints on Risk Measures | 2016-11-07 | Paper |
| Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set | 2016-11-01 | Paper |
| Deriving robust counterparts of nonlinear uncertain inequalities | 2015-02-09 | Paper |
| A Practical Guide to Robust Optimization | 2015-01-12 | Paper |
| Technical Note—Deriving Robust and Globalized Robust Solutions of Uncertain Linear Programs with General Convex Uncertainty Sets | 2014-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2878196 | 2014-08-28 | Paper |
| Robust counterparts of inequalities containing sums of maxima of linear functions | 2014-07-27 | Paper |
| Space-filling Latin hypercube designs for computer experiments | 2014-04-07 | Paper |
| Hidden conic quadratic representation of some nonconvex quadratic optimization problems | 2014-02-25 | Paper |
| Nested maximin Latin hypercube designs | 2013-11-15 | Paper |
| Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions | 2013-10-25 | Paper |
| An impulse control approach to dike height optimization | 2013-06-24 | Paper |
| Safe Dike Heights at Minimal Costs: The Nonhomogeneous Case | 2013-03-12 | Paper |
| Approximating the Pareto set of multiobjective linear programs via robust optimization | 2012-11-08 | Paper |
| On \(D\)-optimality based trust regions for black-box optimization problems | 2012-08-25 | Paper |
| Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets | 2012-07-28 | Paper |
| A Method for Approximating Univariate Convex Functions Using Only Function Value Evaluations | 2012-07-28 | Paper |
| One-dimensional nested maximin designs | 2010-03-17 | Paper |
| Response surface methodology with stochastic constraints for expensive simulation | 2009-10-15 | Paper |
| Maximin Latin Hypercube Designs in Two Dimensions | 2009-08-13 | Paper |
| Multivariate Convex Approximation and Least-Norm Convex Data-Smoothing | 2009-02-10 | Paper |
| On the complexity of optimization over the standard simplex | 2008-07-10 | Paper |
| Robust optimization using computer experiments | 2008-07-10 | Paper |
| Gradient estimation using Lagrange interpolation polynomials | 2008-06-04 | Paper |
| The effect of transformations on the approximation of univariate (convex) functions with applications to Pareto curves | 2008-04-07 | Paper |
| Efficient Line Search Methods for Convex Functions | 2008-02-25 | Paper |
| The correct Kriging variance estimated by bootstrapping | 2006-04-04 | Paper |
| Gradient estimation schemes for noisy functions | 2006-01-13 | Paper |
| Response surface methodology's steepest ascent and step size revisited: Correction | 2005-11-16 | Paper |
| Constrained optimization involving expensive function evaluations: A sequential approach | 2004-11-22 | Paper |
| Response surface methodology's steepest ascent and step size revisited | 2004-08-16 | Paper |
| On convex quadratic approximation | 2004-06-15 | Paper |
| Optimizing color picture tubes by high-cost nonlinear programming | 2002-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4343736 | 1998-02-05 | Paper |
| Inverse barrier methods for linear programming | 1997-03-16 | Paper |
| A sufficient condition for self-concordance, with application to some classes of structured convex programming problems | 1996-09-18 | Paper |
| A logarithmic barrier cutting plane method for convex programming | 1996-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840104 | 1995-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4296156 | 1994-06-15 | Paper |
| On the classical logarithmic barrier function method for a class of smooth convex programming problems | 1994-04-27 | Paper |
| Degeneracy in interior point methods for linear programming: A survey | 1994-02-24 | Paper |
| A long-step barrier method for convex quadratic programming | 1993-12-06 | Paper |
| The linear complementarity problem, sufficient matrices, and the criss- cross method | 1993-08-29 | Paper |
| The Linear Complementary Problem, Sufficient Matrices and the Criss-Cross Method | 1993-05-18 | Paper |
| A build-up variant of the logarithmic barrier method for LP | 1993-01-16 | Paper |
| A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems | 1993-01-16 | Paper |
| A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming | 1993-01-16 | Paper |
| A survey of search directions in interior point methods for linear programming | 1992-06-27 | Paper |
| A Polynomial Method of Weighted Centers for Convex Quadratic Programming | 1992-06-25 | Paper |
| A potential-reduction variant of Renegar's short-step path-following method for linear programming | 1991-01-01 | Paper |
