Cited By
View all- Kanno YOhsaki MKatoh N(2002)Symmetricity of the solution of semidefinite programmingStructural and Multidisciplinary Optimization10.1007/s00158-002-0232-024:3(225-232)Online publication date: Sep-2002
Combinatorial complexity of the central curve
Pages 250 - 255
References
[1]
I. Adler, R. M. Karp, and R. Shamir. A simplex variant solving an m x d linear program in o(min(m2, d2)) expected number of pivot steps. Journal of Complexity, 3:372-387, 1987.
[2]
R. Cottle, J.-S. Pang, and R. Stone. The Linear Complementarity Problem. Academic-Press, Inc., 1992.
[3]
Joe Harris. Algebraic Geometry: A First Course. Springer-Verlag, New York, 1992.
[4]
M. Kojima, N. Megiddo, T. Noma, and A. Yoshise. Lecture Notes in Computer Science: A Unified Approach to Interior Point Algorithms for Linear Complementarity Problem. Springer- Verlag, 1991.
[5]
Renato D.C. Monteiro and Ilan Adler. Interior path following primal-dual algorithms. Part 2: convex quadratic programming. Mathematical Programming, 44:43-66, 1989.
[6]
K.G. Murty. Computational complexity of parameteric linear programming. Mathematical Programming, 19:213-219, 1980.
[7]
J. Renegar and M. Shub. Unified complexity analysis for newton lp methods. Mathematical Programming, 53:1-16, 1992.
[8]
M. J. Todd. Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems. Mathematical Programming, 35:173-192, 1986.
[9]
S. A. Vavasis and Yinyu Ye. An accelerated interior point method whose running time depends only on A. Proceedings of the ~6th Annual A CM Symposium on Theory of Computing, 512-521, 1994.
[10]
G.Y. Zhao a~d J.S. Zhu. The curvature integral and the complexity of linear complementarity problem. Mathematical Programming, 70:107- 122, 1995.
Index Terms
- Combinatorial complexity of the central curve
Recommendations
Planar G2 transition with a fair Pythagorean hodograph quintic curve
Recently planar cubic and Pythagorean hodograph quintic transition curves that are suitable for G2 blending were developed. They are suitable for blending, e.g. rounding corners, or for smooth transition between two curves, e.g. two circular arcs. It ...
Construction of Transition Curve between Nonadjacent Cubic T-B Spline Curves
ICICA 2010: Proceedings of the First International Conference on Information Computing and Applications - Volume 6377In this paper, we investigate the geometric continuous connection between the adjacent cubic T-B spline curves, and the construction of transition curve between nonadjacent T-B spline curves. First, we calculate the expression of cubic T-B spline basis ...
Combinatorial Interpretation of Kolmogorov Complexity
COCO '00: Proceedings of the 15th Annual IEEE Conference on Computational ComplexityThe very first Kolmogorov's paper on algorithmic information theory was entitled Three approaches to the definition of the quantity of information . These three approaches were called combinatorial, probabilistic and algorithmic. Trying to establish ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1997 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 04 May 1997
Check for updates
Qualifiers
- Article
Conference
STOC97
Sponsor:
Acceptance Rates
STOC '97 Paper Acceptance Rate 75 of 211 submissions, 36%;
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%
Upcoming Conference
STOC '25
- Sponsor:
- sigact
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 280Total Downloads
- Downloads (Last 12 months)39
- Downloads (Last 6 weeks)6
Reflects downloads up to 26 Dec 2024
Other Metrics
Citations
Cited By
View all- Kanno YOhsaki MKatoh N(2002)Symmetricity of the solution of semidefinite programmingStructural and Multidisciplinary Optimization10.1007/s00158-002-0232-024:3(225-232)Online publication date: Sep-2002
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in