The following pages link to Oliver Stein (Q213319):
Displaying 50 items.
- Error bounds for mixed integer linear optimization problems (Q263186) (← links)
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques (Q301738) (← links)
- The cone condition and nonsmoothness in linear generalized Nash games (Q306417) (← links)
- Error bounds for mixed integer nonlinear optimization problems (Q315475) (← links)
- Mathematical programs with vanishing constraints: critical point theory (Q427365) (← links)
- (Q604265) (redirect page) (← links)
- Feasible method for generalized semi-infinite programming (Q604267) (← links)
- Operations Research. (Q636211) (← links)
- Lifting mathematical programs with complementarity constraints (Q662308) (← links)
- Global optimization of generalized semi-infinite programs using disjunctive programming (Q670652) (← links)
- Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems (Q695344) (← links)
- On constraint qualifications in nonsmooth optimization. (Q703169) (← links)
- On regular and parametric data envelopment analysis (Q706369) (← links)
- Conditional minimum volume ellipsoid with application to multiclass discrimination (Q732238) (← links)
- Slopes of shadow prices and Lagrange multipliers (Q928294) (← links)
- The linear complementarity problem. An introduction (Q929385) (← links)
- Generalized semi-infinite programming: a tutorial (Q929611) (← links)
- The semismooth approach for semi-infinite programming under the reduction ansatz (Q933800) (← links)
- Convexification of nonsmooth monotone functions (Q933812) (← links)
- Smoothing by mollifiers. II: Nonlinear optimization (Q934788) (← links)
- Smoothing by mollifiers. I: Semi-infinite optimization (Q934789) (← links)
- On the closure of the feasible set in generalized semi-infinite programming (Q940805) (← links)
- Generalized semi-infinite programming: The symmetric reduction ansatz (Q941031) (← links)
- Generalized semi-infinite programming: On generic local minimizers (Q956600) (← links)
- An augmented Lagrangian method for a class of Inverse quadratic programming problems (Q989969) (← links)
- Constrained optimization: Projected gradient flows (Q1024245) (← links)
- On the co-derivative of normal cone mappings to inequality systems (Q1026083) (← links)
- Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions (Q1041446) (← links)
- Generalized semi-infinite optimization: A first order optimality condition and examples (Q1290657) (← links)
- Disjunctive optimization: Critical point theory (Q1379955) (← links)
- Bi-level strategies in semi-infinite programming. (Q1414363) (← links)
- On the complexity of equalizing inequalities (Q1430175) (← links)
- On optimality conditions for generalized semi-infinite programming problems (Q1579665) (← links)
- Global optimization of disjunctive programs (Q1679482) (← links)
- On globally diffeomorphic polynomial maps via Newton polytopes and circuit numbers (Q1745312) (← links)
- The noncooperative transportation problem and linear generalized Nash games (Q1754116) (← links)
- A geometric representation of the Morse fan (Q1777446) (← links)
- On generalized semi-infinite optimization and bilevel optimization (Q1847253) (← links)
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints (Q1850844) (← links)
- Nonconvex optimization: gradient flows and deformation (Q1868373) (← links)
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets (Q1925776) (← links)
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality (Q1938906) (← links)
- Convergent upper bounds in global minimization with nonlinear equality constraints (Q2020617) (← links)
- An explicit Tikhonov algorithm for nested variational inequalities (Q2023653) (← links)
- A general branch-and-bound framework for continuous global multiobjective optimization (Q2038927) (← links)
- Correction to: ``A general branch-and-bound framework for continuous global multiobjective optimization'' (Q2038928) (← links)
- Bounds on the objective value of feasible roundings (Q2189630) (← links)
- Equilibrium selection for multi-portfolio optimization (Q2239878) (← links)
- On smoothness properties of optimal value functions at the boundary of their domain under complete convexity (Q2247981) (← links)
- How to solve a semi-infinite optimization problem (Q2253347) (← links)
