Werner Oettli

According to our database1, Werner Oettli authored at least 19 papers between 1966 and 1998.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1998
Existence of equilibria for monotone multivalued mappings.
Math. Methods Oper. Res., 1998

Conjugate Functions for Convex and Nonconvex Duality.
J. Glob. Optim., 1998

On a Certain Duality for Segmented Minmax Problems.
Computing, 1998

1997
A generalization of vectorial equilibria.
Math. Methods Oper. Res., 1997

1994
A Farkas lemma for difference sublinear systems and quasidifferentiable programming.
Math. Program., 1994

Theorems of the Alternative and Duality for INF-SUP Problems.
Math. Oper. Res., 1994

1993
Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems.
J. Glob. Optim., 1993

1991
An algorithm for indefinite quadratic programming with convex constraints.
Oper. Res. Lett., 1991

Mathematical programs with a two-dimensional reverse convex constraint.
J. Glob. Optim., 1991

1988
Characterization of weakly efficient points.
ZOR Methods Model. Oper. Res., 1988

1975
The theorem of the alternative, the key-theorem, and the vector-maximum problem.
Math. Program., 1975

1974
Capacity-achieving input distributions for some amplitude-limited channels with additive noise (Corresp.).
IEEE Trans. Inf. Theory, 1974

Eine allgemeine, symmetrische Formulierung des Dekompositionsprinzips für duale Paare nichtlinearer Minmax- und Maxmin-Probleme.
Z. Oper. Research, 1974

An Extension of the Method of Feasible Directions.
Proceedings of the Optimization Techniques, 1974

1973
Two Classes of Algorithms for Concave Optimization, and the Calculation of the Capacity of Discrete Memoryless Channels.
J. Inf. Process. Cybern., 1973

1972
An iterative method, having linear rate of convergence, for solving a pair of dual linear programs.
Math. Program., 1972

Technical Note - Direct Proof of the Existence Theorem for Quadratic Programming.
Oper. Res., 1972

1967
On the Capacity of a Discrete, Constant Channel
Inf. Control., September, 1967

1966
Flow in networks with amplification and coupling.
Unternehmensforschung, 1966


  Loading...