Oliver Stein

Orcid: 0000-0001-9514-6317

According to our database1, Oliver Stein authored at least 71 papers between 1995 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A branch-and-prune algorithm for discrete Nash equilibrium problems.
Comput. Optim. Appl., November, 2023

Generalized Polarity and Weakest Constraint Qualifications in Multiobjective Optimization.
J. Optim. Theory Appl., September, 2023

2022 MMOR best paper award.
Math. Methods Oper. Res., April, 2023

Learning to Do or Learning While Doing: Reinforcement Learning and Bayesian Optimisation for Online Continuous Tuning.
CoRR, 2023

2022
2021 MMOR best paper award.
Math. Methods Oper. Res., 2022

Handling Occlusions in Automated Driving Using a Multiaccess Edge Computing Server-Based Environment Model From Infrastructure Sensors.
IEEE Intell. Transp. Syst. Mag., 2022

Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization.
EURO J. Comput. Optim., 2022

Learning-based Optimisation of Particle Accelerators Under Partial Observability Without Real-World Training.
Proceedings of the International Conference on Machine Learning, 2022

2021
Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts.
SIAM J. Optim., 2021

Convergent upper bounds in global minimization with nonlinear equality constraints.
Math. Program., 2021

2020 MMOR best paper award.
Math. Methods Oper. Res., 2021

Correction to: A general branch-and-bound framework for continuous global multiobjective optimization.
J. Glob. Optim., 2021

A general branch-and-bound framework for continuous global multiobjective optimization.
J. Glob. Optim., 2021

Approaches for containerized scientific workflows in cloud environments with applications in life science.
F1000Research, 2021

Equilibrium selection for multi-portfolio optimization.
Eur. J. Oper. Res., 2021

Recent advances in nonconvex semi-infinite programming: Applications and algorithms.
EURO J. Comput. Optim., 2021

Learning from drone observations on highways: characteristics of vehicular traffic at an on-ramp.
Proceedings of the 11th IEEE International Conference on Consumer Electronics, 2021

2020
OR for the classroom.
Math. Methods Oper. Res., 2020

2019 MMOR best paper award.
Math. Methods Oper. Res., 2020

Granularity in Nonlinear Mixed-Integer Optimization.
J. Optim. Theory Appl., 2020

An explicit Tikhonov algorithm for nested variational inequalities.
Comput. Optim. Appl., 2020

Smart Resource Management for Data Streaming using an Online Bin-packing Strategy.
Proceedings of the 2020 IEEE International Conference on Big Data (IEEE BigData 2020), 2020

2019
The Standard Pessimistic Bilevel Problem.
SIAM J. Optim., 2019

Global optimization of generalized semi-infinite programs using disjunctive programming.
J. Glob. Optim., 2019

A feasible rounding approach for mixed-integer optimization problems.
Comput. Optim. Appl., 2019

2018
The noncooperative transportation problem and linear generalized Nash games.
Eur. J. Oper. Res., 2018

2017
Preface to the special issue on advances in continuous optimization on the occasion of EUROPT 2015.
Math. Methods Oper. Res., 2017

Global optimization of disjunctive programs.
J. Glob. Optim., 2017

2016
Error bounds for mixed integer nonlinear optimization problems.
Optim. Lett., 2016

Error bounds for mixed integer linear optimization problems.
Math. Program., 2016

The Cone Condition and Nonsmoothness in Linear Generalized Nash Games.
J. Optim. Theory Appl., 2016

Solving Disjunctive Optimization Problems by Generalized Semi-infinite Optimization Techniques.
J. Optim. Theory Appl., 2016

2015
Coercive Polynomials and Their Newton Polytopes.
SIAM J. Optim., 2015

Editorial.
Math. Methods Oper. Res., 2015

2014
Smoothness properties of a regularized gap function for quasi-variational inequalities.
Optim. Methods Softw., 2014

On smoothness properties of optimal value functions at the boundary of their domain under complete convexity.
Math. Methods Oper. Res., 2014

2013
A lifting method for generalized semi-infinite programs based on lower level Wolfe duality.
Comput. Optim. Appl., 2013

On the Relationship between Correlation Power Analysis and the Stochastic Approach: An ASIC Designer Perspective.
Proceedings of the Progress in Cryptology - INDOCRYPT 2013, 2013

2012
The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets.
Math. Program., 2012

Lifting mathematical programs with complementarity constraints.
Math. Program., 2012

Preface.
Math. Program., 2012

Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems.
J. Glob. Optim., 2012

Mathematical programs with vanishing constraints: critical point theory.
J. Glob. Optim., 2012

How to solve a semi-infinite optimization problem.
Eur. J. Oper. Res., 2012

An adaptable, modular, and autonomous side-channel vulnerability evaluator.
Proceedings of the 2012 IEEE International Symposium on Hardware-Oriented Security and Trust, 2012

2011
The C-Index: A New Stability Concept for Quadratic Programs with Complementarity Constraints.
Math. Oper. Res., 2011

Behördliche Vorgaben zu kryptografischen Algorithmen.
Datenschutz und Datensicherheit, 2011

2009
Generalized Semi-infinite Programming: Optimality Conditions.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Continuous Reformulations of Discrete-Continuous Optimization Problems.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Adaptive Convexification in Semi-Infinite Optimization.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Smoothing Methods for Semi-Infinite Optimization.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Parametric Global Optimization: Sensitivity.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

The Semismooth Approach for Semi-Infinite Programming without Strict Complementarity.
SIAM J. Optim., 2009

2008
Generalized semi-infinite programming: the Symmetric Reduction Ansatz.
Optim. Lett., 2008

Slopes of shadow prices and Lagrange multipliers.
Optim. Lett., 2008

The semismooth approach for semi-infinite programming under the Reduction Ansatz.
J. Glob. Optim., 2008

Smoothing by mollifiers. Part II: nonlinear optimization.
J. Glob. Optim., 2008

Smoothing by mollifiers. Part I: semi-infinite optimization.
J. Glob. Optim., 2008

Generalized Semi-Infinite Programming: on generic local minimizers.
J. Glob. Optim., 2008

Editorial.
Central Eur. J. Oper. Res., 2008

2007
The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming.
SIAM J. Optim., 2007

On the closure of the feasible set in generalized semi-infinite programming.
Central Eur. J. Oper. Res., 2007

2004
On regular and parametric data envelopment analysis.
Math. Methods Oper. Res., 2004

Continuous reformulations of discrete-continuous optimization problems.
Comput. Chem. Eng., 2004

2003
Solving Semi-Infinite Optimization Problems with Interior Point Techniques.
SIAM J. Control. Optim., 2003

On the Complexity of Equalizing Inequalities.
J. Glob. Optim., 2003

2002
On generalized semi-infinite optimization and bilevel optimization.
Eur. J. Oper. Res., 2002

2001
First-Order Optimality Conditions for Degenerate Index Sets in Generalized Semi-Infinite Optimization.
Math. Oper. Res., 2001

On Linear and Linearized Generalized Semi-Infinite Optimization Problems.
Ann. Oper. Res., 2001

1995
Generalized Semi-Infinite Optimization: A First Order Optimality Condition and Examples
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

On Generic One-Parametric Semi-Infinite Optimization
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995


  Loading...