default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWerner Oettli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
[j18]G. Meinardus, Werner Oettli:
On a Certain Duality for Segmented Minmax Problems. Computing 61(2): 91-102 (1998)- [j17]Werner Oettli, Dirk Schläger:
Conjugate Functions for Convex and Nonconvex Duality. J. Glob. Optim. 13(4): 337-347 (1998) - [j16]Werner Oettli, Dirk Schläger:
Existence of equilibria for monotone multivalued mappings. Math. Methods Oper. Res. 48(2): 219-228 (1998) - 1997
- [j15]Qamrul Hasan Ansari, Werner Oettli, Dirk Schläger:
A generalization of vectorial equilibria. Math. Methods Oper. Res. 46(2): 147-152 (1997) - 1994
- [j14]Joachim Gwinner, Werner Oettli:
Theorems of the Alternative and Duality for INF-SUP Problems. Math. Oper. Res. 19(1): 238-256 (1994) - [j13]Bevil Milton Glover, Vaithilingam Jeyakumar
, Werner Oettli:
A Farkas lemma for difference sublinear systems and quasidifferentiable programming. Math. Program. 63: 109-125 (1994) - 1993
- [j12]Le Dung Muu, Werner Oettli:
Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems. J. Glob. Optim. 3(3): 377-391 (1993) - 1991
- [j11]Phan Thien Thach, Rainer E. Burkard, Werner Oettli:
Mathematical programs with a two-dimensional reverse convex constraint. J. Glob. Optim. 1(2): 145-154 (1991) - [j10]Le Dung Muu, Werner Oettli:
An algorithm for indefinite quadratic programming with convex constraints. Oper. Res. Lett. 10(6): 323-327 (1991)
1980 – 1989
- 1988
- [j9]Gabriele Heinecke, Werner Oettli:
Characterization of weakly efficient points. ZOR Methods Model. Oper. Res. 32(6): 375-393 (1988)
1970 – 1979
- 1975
- [j8]R. Lehmann, Werner Oettli:
The theorem of the alternative, the key-theorem, and the vector-maximum problem. Math. Program. 8(1): 332-344 (1975) - 1974
- [j7]Werner Oettli:
Eine allgemeine, symmetrische Formulierung des Dekompositionsprinzips für duale Paare nichtlinearer Minmax- und Maxmin-Probleme. Z. Oper. Research 18(1): 1-18 (1974) - [j6]Werner Oettli:
Capacity-achieving input distributions for some amplitude-limited channels with additive noise (Corresp.). IEEE Trans. Inf. Theory 20(3): 372-374 (1974) - [c1]E. Blum, Werner Oettli:
An Extension of the Method of Feasible Directions. Optimization Techniques 1974: 280-283 - 1973
- [j5]Bernd Meister, Werner Oettli:
Two Classes of Algorithms for Concave Optimization, and the Calculation of the Capacity of Discrete Memoryless Channels. J. Inf. Process. Cybern. 9(4/5): 189-195 (1973) - 1972
- [j4]E. Blum, Werner Oettli:
Technical Note - Direct Proof of the Existence Theorem for Quadratic Programming. Oper. Res. 20(1): 165-167 (1972) - [j3]Werner Oettli:
An iterative method, having linear rate of convergence, for solving a pair of dual linear programs. Math. Program. 3(1): 302-311 (1972)
1960 – 1969
- 1967
- [j2]Bernd Meister, Werner Oettli:
On the Capacity of a Discrete, Constant Channel. Inf. Control. 11(3): 341-351 (1967) - 1966
- [j1]Werner Oettli, William Prager:
Flow in networks with amplification and coupling. Unternehmensforschung 10(1): 42-49 (1966)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
