The DOI matches its Crossref record.
Interior Point Algorithms: Theory and Analysis
Abstract
Geometry of Convex Inequalities. Computation of Analytic Center. Linear Programming Algorithms. Worst-Case Analysis. Average-Case Analysis. Asymptotic Analysis. Convex Optimization. Nonconvex Optimization. Implementation Issues. Bibliography. Index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Semidefinite Relaxation of Quadratic Optimization Problems
Luo, Z.-Q., Ma, W.-K., So, A., Ye, Y., & Zhang, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936019 · Cited by 3,715
Self-citationAn Interior-Point Method for Large-Scale -Regularized Least Squares
Kim, S.-J., Koh, K., Lustig, M., Boyd, S., & Gorinevsky, D. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910971 · Cited by 2,083
Disciplined Convex Programming
Grant, M., Boyd, S., & Ye, Y. (2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30528-9_7 · Cited by 1,026
Self-citationDynamic Spectrum Management: Complexity and Duality
Luo, Z.-Q., & Zhang, S. (2008) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.914876 · Cited by 929
CVXGEN: a code generator for embedded convex optimization
Mattingley, J., & Boyd, S. (2012) · Optimization and Engineering · doi:10.1007/s11081-011-9176-9 · Cited by 790
Andersen, E. D., & Andersen, K. D. (2000) · Applied Optimization · doi:10.1007/978-1-4757-3216-0_8 · Cited by 766
Fastest Mixing Markov Chain on a Graph
Boyd, S., Diaconis, P., & Xiao, L. (2004) · SIAM Review · doi:10.1137/s0036144503423264 · Cited by 744
Potra, F. A., & Wright, S. J. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00433-7 · Cited by 726
Convex Programming Approach to Powered Descent Guidance for Mars Landing
Acikmese, B., & Ploen, S. R. (2007) · Journal of Guidance, Control, and Dynamics · doi:10.2514/1.27553 · Cited by 697
Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
O’Donoghue, B., Chu, E., Parikh, N., & Boyd, S. (2016) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-016-0892-3 · Cited by 664
Quality of Service and Max-Min Fair Transmit Beamforming to Multiple Cochannel Multicast Groups
Karipidis, E., Sidiropoulos, N. D., & Luo, Z.-Q. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.909010 · Cited by 585
(2025) · Portfolio Optimization · doi:10.1017/9781009428095.021 · Cited by 553
Chance-Constrained Optimal Path Planning With Obstacles
Blackmore, L., Ono, M., & Williams, B. C. (2011) · IEEE Transactions on Robotics · doi:10.1109/tro.2011.2161160 · Cited by 427
Interior Point Methods for Nonlinear Optimization
Pólik, I., & Terlaky, T. (2010) · Lecture Notes in Mathematics · doi:10.1007/978-3-642-11339-0_4 · Cited by 394
Symbiotic Radio: A New Communication Paradigm for Passive Internet of Things
Long, R., Liang, Y.-C., Guo, H., Yang, G., & Zhang, R. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2954678 · Cited by 392
Simultaneous Variable Selection
Turlach, B. A., Venables, W. N., & Wright, S. J. (2005) · Technometrics · doi:10.1198/004017005000000139 · Cited by 386
Sparse Beamforming and User-Centric Clustering for Downlink Cloud Radio Access Network
Dai, B., & Yu, W. (2014) · IEEE Access · doi:10.1109/access.2014.2362860 · Cited by 383
Minimum-Landing-Error Powered-Descent Guidance for Mars Landing Using Convex Optimization
Blackmore, L., Açikmeşe, B., & Scharf, D. P. (2010) · Journal of Guidance, Control, and Dynamics · doi:10.2514/1.47202 · Cited by 378
Portfolio optimization with linear and fixed transaction costs
Lobo, M. S., Fazel, M., & Boyd, S. (2007) · Annals of Operations Research · doi:10.1007/s10479-006-0145-1 · Cited by 350
Optimization Methods in Finance
Cornuejols, G., & Tütüncü, R. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511753886 · Cited by 347
Wright, M. (2004) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-04-01040-7 · Cited by 345
Statistical ranking and combinatorial Hodge theory
Jiang, X., Lim, L.-H., Yao, Y., & Ye, Y. (2011) · Mathematical Programming · doi:10.1007/s10107-010-0419-x · Cited by 335
Self-citationOptimal Scaling of a Gradient Method for Distributed Resource Allocation
Xiao, L., & Boyd, S. (2006) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-006-9080-1 · Cited by 326
Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
Benson, S. J., Ye, Y., & Zhang, X. (2000) · SIAM Journal on Optimization · doi:10.1137/s1052623497328008 · Cited by 276
Self-citationInterior-point methods for optimization
Nemirovski, A. S., & Todd, M. J. (2008) · Acta Numerica · doi:10.1017/s0962492906370018 · Cited by 265
Primal and dual linear decision rules in stochastic and robust optimization
Kuhn, D., Wiesemann, W., & Georghiou, A. (2011) · Mathematical Programming · doi:10.1007/s10107-009-0331-4 · Cited by 256
A note on the complexity of L p minimization
Ge, D., Jiang, X., & Ye, Y. (2011) · Mathematical Programming · doi:10.1007/s10107-011-0470-2 · Cited by 254
Self-citation
Metadata
- Authors
- Ye, Y.
- Venue
- Wiley eBooks
- Publisher
- Wiley
- Published
- 1997-08-11
- OpenAlex
- W1509805685
- Cited by
- 939
- References
- 0
- FWCI
- 4.76
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.