default search action
Stephen E. Wright
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Stephen E. Wright:
A note on computing maximum likelihood estimates for the three-parameter asymmetric Laplace distribution. Appl. Math. Comput. 464: 128381 (2024) - 2023
- [j16]Stephen E. Wright:
Direct solution of the normal equations in interior point methods for convex transportation problems. Oper. Res. Lett. 51(5): 469-472 (2023) - 2020
- [j15]Stephen E. Wright, Sooyeong Lim:
Solving nested-constraint resource allocation problems with an interior point method. Oper. Res. Lett. 48(3): 297-303 (2020)
2010 – 2019
- 2016
- [j14]Andrew J. Sage, Stephen E. Wright:
Obtaining cell counts for contingency tables from rounded conditional frequencies. Eur. J. Oper. Res. 250(1): 91-100 (2016) - 2014
- [j13]Stephen E. Wright, Byran J. Smucker:
Rapid calculation of exact cell bounds for contingency tables from conditional frequencies. Comput. Oper. Res. 52: 113-122 (2014) - [j12]Stephen E. Wright, Byran J. Smucker:
An Intuitive Formulation and Solution of the Exact Cell-Bounding Problem for Contingency Tables of Conditional Frequencies. J. Priv. Confidentiality 5(2) (2014) - [j11]Stephen E. Wright, James J. Rohal:
Solving the continuous nonlinear resource allocation problem with an interior point method. Oper. Res. Lett. 42(6-7): 404-408 (2014) - 2012
- [j10]Stephen E. Wright:
New linearizations of quadratic assignment problems. Comput. Oper. Res. 39(11): 2858-2866 (2012) - [j9]Olga Brezhneva, Alexey Tret'yakov
, Stephen E. Wright:
A short elementary proof of the Lagrange multiplier theorem. Optim. Lett. 6(8): 1597-1601 (2012) - 2011
- [j8]Stephen E. Wright:
A note on the equality of rank and trace for an idempotent matrix. Appl. Math. Comput. 217(16): 7048-7049 (2011) - 2010
- [j7]Stephen E. Wright:
Integer matrices with constraints on leading partial row and column sums. Discret. Appl. Math. 158(16): 1838-1847 (2010) - [j6]Stephen E. Wright:
On the Dimension of a Face Exposed by Proper Separation of Convex Polyhedra. Discret. Comput. Geom. 43(2): 467-476 (2010)
2000 – 2009
- 2009
- [j5]Olga Brezhneva, Alexey Tret'yakov
A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization. Optim. Lett. 3(1): 7-10 (2009) - 2008
- [j4]Stephen E. Wright:
Identifying the optimal partition in convex quadratic programming. Oper. Res. Lett. 36(1): 67-70 (2008) - [j3]Eugen J. Ionascu, Dan Pritikin, Stephen E. Wright:
k-Dependence and Domination in Kings Graphs. Am. Math. Mon. 115(9): 820-836 (2008) - 2005
- [p1]Alan J. King, Stephen E. Wright, Gyana R. Parija, Robert Entriken:
3. The IBM Stochastic Programming System. Applications of Stochastic Programming 2005: 21-36 - 2000
- [j2]Stephen E. Wright:
A General Primal-Dual Envelope Method for Convex Programming Problems. SIAM J. Optim. 10(2): 405-414 (2000) - [j1]Stephen E. Wright:
A Note on Positively Spanning Sets. Am. Math. Mon. 107(4): 364-366 (2000)
1990 – 1999
- 1996
- [c1]Stephen E. Wright, Branislav Vuksanovic:
Optimisation of controlled acoustic shadows. ICASSP 1996: 973-976
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:46 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: