default search action
Kurt M. Anstreicher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j57]Kurt M. Anstreicher
:
Solving Two-Trust-Region Subproblems Using Semidefinite Optimization with Eigenvector Branching. J. Optim. Theory Appl. 202(1): 303-319 (2024) - 2021
- [j56]Kurt M. Anstreicher
Convex hull representations for bounded products of variables. J. Glob. Optim. 80(4): 757-778 (2021) - [j55]Kurt M. Anstreicher
Quadratic optimization with switching variables: the convex hull for n=2. Math. Program. 188(2): 421-441 (2021) - 2020
- [j54]Kurt M. Anstreicher
Efficient Solution of Maximum-Entropy Sampling Problems. Oper. Res. 68(6): 1826-1835 (2020)
2010 – 2019
- 2018
- [j53]Kurt M. Anstreicher:
Maximum-entropy sampling and the Boolean quadric polytope. J. Glob. Optim. 72(4): 603-618 (2018) - [j52]Boshi Yang
Quadratic programs with hollows. Math. Program. 170(2): 541-553 (2018) - 2017
- [j51]Kurt M. Anstreicher:
Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem. SIAM J. Optim. 27(1): 368-378 (2017) - 2013
- [j50]Jon W. Van Laarhoven, Kurt M. Anstreicher:
Geometric conditions for Euclidean Steiner trees in ℜd. Comput. Geom. 46(5): 520-531 (2013) - [j49]Hongbo Dong, Kurt M. Anstreicher:
Separating doubly nonnegative and completely positive matrices. Math. Program. 137(1-2): 131-153 (2013) - [j48]Samuel Burer, Kurt M. Anstreicher:
Second-Order-Cone Constraints for Extended Trust-Region Subproblems. SIAM J. Optim. 23(1): 432-451 (2013) - 2012
- [j47]Kurt M. Anstreicher:
On convex relaxations for quadratically constrained quadratic programming. Math. Program. 136(2): 233-251 (2012) - [j46]Kurt M. Anstreicher:
Interior-point algorithms for a generalization of linear programming and weighted centring. Optim. Methods Softw. 27(4-5): 605-612 (2012) - 2010
- [j45]Kurt M. Anstreicher, Samuel Burer:
Computable representations for convex hulls of low-dimensional quadratic forms. Math. Program. 124(1-2): 33-43 (2010)
2000 – 2009
- 2009
- [j44]Kurt M. Anstreicher:
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Glob. Optim. 43(2-3): 471-484 (2009) - [j43]Kurt M. Anstreicher, Laurence A. Wolsey:
Two "well-known" properties of subgradient optimization. Math. Program. 120(1): 213-220 (2009) - [r2]Kurt M. Anstreicher:
Linear Programming: Interior Point Methods. Encyclopedia of Optimization 2009: 1886-1889 - [r1]Kurt M. Anstreicher:
Linear Programming: Karmarkar Projective Algorithm. Encyclopedia of Optimization 2009: 1889-1891 - 2008
- [j42]Marcia Fampa
An improved algorithm for computing Steiner minimal trees in Euclidean d-space. Discret. Optim. 5(2): 530-540 (2008) - [j41]Kurt M. Anstreicher, Alfredo N. Iusem:
Continuous optimization: 5th Brazilian workshop. Math. Program. 111(1-2): 1-4 (2008) - 2005
- [j40]Kurt M. Anstreicher, Samuel Burer:
D.C. Versus Copositive Bounds for Standard QP. J. Glob. Optim. 33(2): 299-312 (2005) - 2004
- [j39]Kurt M. Anstreicher:
The Thirteen Spheres: A New Proof. Discret. Comput. Geom. 31(4): 613-625 (2004) - [j38]Kurt M. Anstreicher:
The volumetric barrier for convex quadratic constraints. Math. Program. 100(3): 613-662 (2004) - [p1]Nathan W. Brixius
The Steinberg Wiring Problem. The Sharpest Cut 2004: 293-307 - 2003
- [j37]Kurt M. Anstreicher:
Recent advances in the solution of quadratic assignment problems. Math. Program. 97(1-2): 27-42 (2003) - 2002
- [j36]Kurt M. Anstreicher:
Improved Linear Programming Bounds for Antipodal Spherical Codes. Discret. Comput. Geom. 28(1): 107-114 (2002) - [j35]Kurt M. Anstreicher, Nathan W. Brixius
Solving large quadratic assignment problems on computational grids. Math. Program. 91(3): 563-588 (2002) - [j34]Kurt M. Anstreicher:
Improved Complexity for Maximum Volume Inscribed Ellipsoids. SIAM J. Optim. 13(2): 309-320 (2002) - 2001
- [j33]Kurt M. Anstreicher, Marcia Fampa
Maximum-entropy remote sampling. Discret. Appl. Math. 108(3): 211-226 (2001) - [j32]Kurt M. Anstreicher, Nathan W. Brixius
A new bound for the quadratic assignment problem based on convex quadratic programming. Math. Program. 89(3): 341-357 (2001) - 2000
- [j31]Kurt M. Anstreicher:
The Volumetric Barrier for Semidefinite Programming. Math. Oper. Res. 25(3): 365-380 (2000) - [j30]Kurt M. Anstreicher, Margaret H. Wright:
A Note on the Augmented Hessian When the Reduced Hessian is Semidefinite. SIAM J. Optim. 11(1): 243-253 (2000) - [j29]Kurt M. Anstreicher:
Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem. SIAM J. Optim. 11(1): 254-265 (2000) - [j28]Kurt M. Anstreicher, Henry Wolkowicz:
On Lagrangian Relaxation of Quadratic Matrix Constraints. SIAM J. Matrix Anal. Appl. 22(1): 41-55 (2000)
1990 – 1999
- 1999
- [j27]Kurt M. Anstreicher, Jun Ji, Florian A. Potra, Yinyu Ye:
Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming. Math. Oper. Res. 24(1): 176-192 (1999) - [j26]Kurt M. Anstreicher:
Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier. Math. Oper. Res. 24(1): 193-203 (1999) - [j25]Kurt M. Anstreicher, Marcia Fampa
Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems. Math. Program. 85(2): 221-240 (1999) - [j24]Kurt M. Anstreicher:
Linear Programming in O([n3/ln n]L) Operations. SIAM J. Optim. 9(4): 803-812 (1999) - 1998
- [j23]Kurt M. Anstreicher:
Towards a Practical Volumetric Cutting Plane Method for Convex Programming. SIAM J. Optim. 9(1): 190-206 (1998) - 1997
- [j22]Kurt M. Anstreicher:
On Vaidya's Volumetric Cutting Plane Method for Convex Programming. Math. Oper. Res. 22(1): 63-89 (1997) - 1996
- [j21]Kurt M. Anstreicher:
Large step volumetric potential reduction algorithms for linear programming. Ann. Oper. Res. 62(1): 521-538 (1996) - [j20]Kurt M. Anstreicher, Robert M. Freund:
Preface. Ann. Oper. Res. 62(1) (1996) - [j19]Kurt M. Anstreicher:
Volumetric path following algorithms for linear programming. Math. Program. 76: 245-263 (1996) - [j18]Kurt M. Anstreicher:
On Long Step Path Following and SUMT for Linear and Quadratic Programming. SIAM J. Optim. 6(1): 33-46 (1996) - [c1]Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams:
Continuous Relaxations for Constrained Maximum-Entropy Sampling. IPCO 1996: 234-248 - 1995
- [j17]Kurt M. Anstreicher, Robert A. Bosch:
A New Infinity-Norm Path Following Algorithm for Linear Programming. SIAM J. Optim. 5(2): 236-246 (1995) - 1994
- [j16]Kurt M. Anstreicher, Tamás Terlaky:
A Monotonic Build-Up Simplex Algorithm for Linear Programming. Oper. Res. 42(3): 556-561 (1994) - 1993
- [j15]Robert A. Bosch, Kurt M. Anstreicher:
On Partial Updating in a Potential Reduction Linear Programming Algorithm of Kojima, Mizuno, and Yoshise. Algorithmica 9(2): 184-197 (1993) - [j14]Kurt M. Anstreicher, Dick den Hertog, Cornelis Roos, Tamás Terlaky
A Long-Step Barrier Method for Convex Quadratic Programming. Algorithmica 10(5): 365-382 (1993) - [j13]Kurt M. Anstreicher, Patrick Watteyne:
A Family of Search Directions for Karmarkar's Algorithm. Oper. Res. 41(4): 759-767 (1993) - [j12]Kurt M. Anstreicher:
Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming. Math. Program. 62: 517-535 (1993) - [j11]Yinyu Ye, Kurt M. Anstreicher:
On quadratic and O(qudar root(n) * L) convergence of a predictor-corrector algorithm for LCP. Math. Program. 62: 537-551 (1993) - 1992
- [j10]Kurt M. Anstreicher, Robert A. Bosch:
Long steps in an O(n3L) algorithm for linear programming. Math. Program. 54: 251-265 (1992) - [j9]Kurt M. Anstreicher, Jon Lee
Crashing a maximum-weight complementary basis. Math. Program. 54: 281-294 (1992) - [j8]Kurt M. Anstreicher:
On interior algorithms for linear programming with no regularity assumptions. Oper. Res. Lett. 11(4): 209-212 (1992) - 1991
- [j7]Kurt M. Anstreicher:
A combined phase I-phase II scaled potential algorithm for linear programming. Math. Program. 52: 429-439 (1991) - [j6]Kurt M. Anstreicher:
On the Performance of Karmarkar's Algorithm over a Sequence of Iterations. SIAM J. Optim. 1(1): 22-29 (1991) - 1990
- [j5]Kurt M. Anstreicher:
A Standard Form Variant, and Safeguarded Linesearch, for the Modified Karmarkar Algorithm. Math. Program. 47: 337-351 (1990)
1980 – 1989
- 1989
- [j4]Kurt M. Anstreicher:
The Worst-Case Step in Karmarkar's Algorithm. Math. Oper. Res. 14(2): 294-302 (1989) - [j3]Kurt M. Anstreicher:
A combined phase I-phase II projective algorithm for linear programming. Math. Program. 43(1-3): 209-223 (1989) - 1988
- [j2]Kurt M. Anstreicher:
Linear programming and the newton barrier flow. Math. Program. 41(1-3): 367-373 (1988) - 1986
- [j1]Kurt M. Anstreicher:
A Monotonic Projective Algorithm for Fractional Linear Programming. Algorithmica 1(4): 483-498 (1986)
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-10-07 22:23 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: