default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKenneth O. Kortanek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j26]Kenneth O. Kortanek, Guolin Yu, Qinghong Zhang
:
Strong duality for standard convex programs. Math. Methods Oper. Res. 94(3): 413-436 (2021)
2010 – 2019
- 2019
- [j25]Qinghong Zhang, Kenneth O. Kortanek:
On a Compound Duality Classification for Geometric Programming. J. Optim. Theory Appl. 180(3): 711-728 (2019) - 2017
- [j24]Dennis L. Bricker, Kenneth O. Kortanek:
Perfect Duality in Solving Geometric Programming Problems Under Uncertainty. J. Optim. Theory Appl. 173(3): 1055-1065 (2017)
2000 – 2009
- 2009
- [r2]Kenneth O. Kortanek, Vladimir G. Medvedev:
Semi-infinite Programming and Applications in Finance. Encyclopedia of Optimization 2009: 3396-3404 - [r1]Kenneth O. Kortanek, Qinghong Zhang:
Semi-infinite Programming, Semidefinite Programming and Perfect Duality. Encyclopedia of Optimization 2009: 3439-3445 - 2001
- [j23]Kenneth O. Kortanek, Qinghong Zhang:
Perfect duality in semi-infinite and semidefinite programming. Math. Program. 91(1): 127-144 (2001)
1990 – 1999
- 1997
- [j22]Dennis L. Bricker, Kenneth O. Kortanek, Lina Xu:
Maximum likelihood estimates with order restrictions on probabilities and odds ratios: A geometric programming approach. Adv. Decis. Sci. 1(1): 53-65 (1997) - [j21]Pierre Moulin, Mihai Anitescu, Kenneth O. Kortanek, Florian A. Potra:
The role of linear semi-infinite programming in signal-adapted QMF bank design. IEEE Trans. Signal Process. 45(9): 2160-2174 (1997) - 1996
- [j20]Kenneth O. Kortanek, Xiaojie Xu, Yinyu Ye:
An infeasible interior-point algorithm for solving primal and dual geometric programs. Math. Program. 76: 155-181 (1996) - [c2]Pierre Moulin, Mihai Anitescu, Kenneth O. Kortanek, Florian A. Potra:
Design of signal-adapted FIR paraunitary filter banks. ICASSP 1996: 1519-1522 - 1995
- [j19]Kenneth O. Kortanek, Maretsugu Yamasaki:
Discrete Infinite Transportation Problems. Discret. Appl. Math. 58(1): 19-33 (1995) - 1993
- [j18]Kenneth O. Kortanek:
Semi-infinite programming duality for order restricted statistical inference models. ZOR Methods Model. Oper. Res. 37(3): 285-301 (1993) - [j17]Kenneth O. Kortanek, Jishan Zhu:
A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems. Math. Oper. Res. 18(1): 116-127 (1993) - [j16]Yinyu Ye, Kenneth O. Kortanek, John A. Kaliski, S. Huang:
Near boundary behavior of primal-dual potential reduction algorithms for linear programming. Math. Program. 58: 243-255 (1993) - [j15]Kenneth O. Kortanek, Hoon No:
A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems. SIAM J. Optim. 3(4): 901-918 (1993) - [j14]Rainer Hettich, Kenneth O. Kortanek:
Semi-Infinite Programming: Theory, Methods, and Applications. SIAM Rev. 35(3): 380-429 (1993) - [j13]Kenneth O. Kortanek:
Vector-Supercomputer Experiments with the Primal Affine Linear Programming Scaling Algorithm. SIAM J. Sci. Comput. 14(2): 279-294 (1993) - 1991
- [j12]S. Huang, Kenneth O. Kortanek:
A note on a potential reduction algorithm for LP with simultaneous primal-dual updating. Oper. Res. Lett. 10(9): 501-507 (1991)
1980 – 1989
- 1985
- [j11]Kenneth O. Kortanek, George G. Polak:
Network design and dynamic routing under queueing demand. Z. Oper. Research 29(5): 141-160 (1985) - [j10]Kenneth O. Kortanek, H. M. Strojwas:
On constraint sets of infinite linear programs over ordered fields. Math. Program. 33(2): 146-161 (1985) - 1983
- [j9]Kenneth O. Kortanek, H. M. Strojwas:
On extreme points of bounded sets of generalized finite sequence spaces. Z. Oper. Research 27(1): 145-157 (1983) - 1982
- [c1]Sven-Åke Gustafson, Kenneth O. Kortanek:
Semi-Infinite Programming and Applications. ISMP 1982: 132-157 - 1980
- [j8]Abraham Charnes, Paul R. Gribik, Kenneth O. Kortanek:
Separably-infinite programs. Z. Oper. Research 24(1): 33-45 (1980) - [j7]Abraham Charnes, Paul R. Gribik, Kenneth O. Kortanek:
Polyextremal principles and separably-infinite programs. Z. Oper. Research 24(7): 211-234 (1980)
1970 – 1979
- 1973
- [j6]Kenneth O. Kortanek, Walter O. Rom, Allen L. Soyster:
Solution Sets of Convex Programs Related to Chemical Equilibrium Problems. Oper. Res. 21(1): 240-246 (1973) - 1972
- [j5]Kenneth O. Kortanek, Allen L. Soyster:
On Refinements of Some Duality Theorems in Linear Programming over Cones. Oper. Res. 20(1): 137-142 (1972) - 1971
- [j4]Kenneth O. Kortanek, Walter O. Rom:
Classification Schemes for the Strong Duality of Linear Programming Over Cones. Oper. Res. 19(7): 1571-1585 (1971)
1960 – 1969
- 1968
- [j3]Kenneth O. Kortanek, J. P. Evans:
Asymptotic Lagrange Regularity for Pseudoconcave Programming with Weak Constraint Qualification. Oper. Res. 16(4): 849-857 (1968) - 1967
- [j2]Kenneth O. Kortanek, J. P. Evans:
Pseudo-Concave Programming and Lagrange Regularity. Oper. Res. 15(5): 882-891 (1967) - [j1]Kenneth O. Kortanek, Robert G. Jeroslow:
Letter to the Editor - A Note on Some Classical Methods in Constrained Optimization and Positively Bounded Jacobians. Oper. Res. 15(5): 964-969 (1967)
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-24 23:11 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:
