The following pages link to Oliver Stein (Q213319):
Displaying 50 items.
- On smooth relaxations of obstacle sets (Q2254177) (← links)
- Granularity in nonlinear mixed-integer optimization (Q2302751) (← links)
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (Q2355020) (← links)
- Global convergence of a robust smoothing SQP method for semi-infinite programming (Q2370033) (← links)
- A homotopy interior point method for semi-infinite programming problems (Q2385505) (← links)
- A feasible rounding approach for mixed-integer optimization problems (Q2419508) (← links)
- Rearrangement optimization for some elliptic equations (Q2483039) (← links)
- Operations research. Deterministic models and methods. (Q2574752) (← links)
- Some results on quasipolyhedral convexity (Q2644431) (← links)
- The reduction ansatz in absence of lower semi-continuity (Q2722332) (← links)
- A Semi-Infinite Programming Model In Data Envelopment Analysis (Q2747937) (← links)
- First-order optimality conditions for degenerate index sets in generalized semi-infinite optimi\-zation. (Q2757682) (← links)
- The feasible set in generalized semi-infinite optimization (Q2759584) (← links)
- On convex lower level problems in generalized semi-infinite optimization. (Q2776649) (← links)
- Proximal interior point method for convex semi-infinite programming (Q2778680) (← links)
- A note on the dual description of projected polytopes (Q2783492) (← links)
- Theoretical approach for the calculation of a feasible point of the special non-convex set described by a polyhedron and a quadratic function (Q2786333) (← links)
- The C-index: a new stability concept for quadratic programs with complementarity constraints (Q2884286) (← links)
- On jet-convex functions and their tensor products (Q2903151) (← links)
- Smoothness properties of a regularized gap function for quasi-variational inequalities (Q2926051) (← links)
- A semi-infinite approach to design centering (Q3436942) (← links)
- (Q3541566) (← links)
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming (Q3544257) (← links)
- The Semismooth Approach for Semi-Infinite Programming without Strict Complementarity (Q3563921) (← links)
- (Q4349354) (← links)
- (Q4362999) (← links)
- On Generic One-Parametric Semi-Infinite Optimization (Q4376155) (← links)
- (Q4432400) (← links)
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques (Q4443016) (← links)
- (Q4464669) (← links)
- On level sets of marginal functions (Q4500798) (← links)
- Grundzüge der Globalen Optimierung (Q4600380) (← links)
- Grundzüge der Nichtlinearen Optimierung (Q4600450) (← links)
- Coercive polynomials: stability, order of growth, and Newton polytopes (Q4613988) (← links)
- (Q4872795) (← links)
- On differentiability properties of player convex generalized Nash equilibrium problems (Q4981861) (← links)
- Interactions Between Bilevel Optimization and Nash Games (Q5014624) (← links)
- Grundzüge der Parametrischen Optimierung (Q5129906) (← links)
- Grundzüge der Globalen Optimierung (Q5140868) (← links)
- Grundzüge der Nichtlinearen Optimierung (Q5140909) (← links)
- Grundzüge der Konvexen Analysis (Q5147472) (← links)
- Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts (Q5158763) (← links)
- The Standard Pessimistic Bilevel Problem (Q5231679) (← links)
- (Q5437422) (← links)
- (Q5440595) (← links)
- Coercive Polynomials and Their Newton Polytopes (Q5502243) (← links)
- Feasible rounding approaches for equality constrained mixed-integer optimization problems (Q5880390) (← links)
- On linear and linearized generalized semi-infinite optimization problems (Q5948177) (← links)
- Coincidence of generic relative minimum singularities in problems with explicit and implicit constraints (Q5948397) (← links)
- On the locally uniform openness of polyhedral sets (Q5954623) (← links)
