The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
ECOS: An SOCP solver for embedded systems
Abstract
In this paper, we describe the embedded conic solver (ECOS), an interior-point solver for second-order cone programming (SOCP) designed specifically for embedded applications. ECOS is written in low footprint, single-threaded, library-free ANSI-C and so runs on most embedded platforms. The main interior-point algorithm is a standard primal-dual Mehrotra predictor-corrector method with Nesterov-Todd scaling and self-dual embedding, with search directions found via a symmetric indefinite KKT system, chosen to allow stable factorization with a fixed pivoting order. The indefinite system is solved using Davis' SparseLDL package, which we modify by adding dynamic regularization and iterative refinement for stability and reliability, as is done in the CVXGEN code generation system, allowing us to avoid all numerical pivoting; the elimination ordering is found entirely symbolically. This keeps the solver simple, only 750 lines of code, with virtually no variation in run time. For small problems, ECOS is faster than most existing SOCP solvers; it is still competitive for medium-sized problems up to tens of thousands of variables.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Self-citationCandes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Applications of second-order cone programming
Lobo, M. S., Vandenberghe, L., Boyd, S., & Lebret, H. (1998) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(98)10032-0 · Cited by 2,401
Self-citationPrimal-Dual Interior-Point Methods
Wright, S. J. (1997) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971453 · Cited by 2,391
SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
Toh, K. C., Todd, M. J., & Tütüncü, R. H. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805762 · Cited by 1,894
Fast Model Predictive Control Using Online Optimization
Wang, Y., & Boyd, S. (2010) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2009.2017934 · Cited by 1,372
Self-citationCVXGEN: 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
Self-citationAndersen, E. D., & Andersen, K. D. (2000) · Applied Optimization · doi:10.1007/978-1-4757-3216-0_8 · Cited by 766
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
SDPT3 -- A Matlab Software Package for Semidefinite Programming
Toh, K.-C., Todd, M. J., & Tütüncü, R. H. (1996) · eCommons (Cornell University) · Cited by 663
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
Nesterov, Y. E., & Todd, M. J. (1997) · Mathematics of Operations Research · doi:10.1287/moor.22.1.1 · Cited by 612
An online active set strategy to overcome the limitations of explicit MPC
Ferreau, H. J., Bock, H. G., & Diehl, M. (2008) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.1251 · Cited by 608
An introduction to convex optimization for communications and signal processing
Luo, Z.-Q., & Yu, W. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879347 · Cited by 562
Constrained Control and Estimation: An Optimisation Approach
Goodwin, G. C., Seron, M. M., & de Don, J. A. (2004) · Cited by 370
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
Ye, Y., Todd, M. J., & Mizuno, S. (1994) · Mathematics of Operations Research · doi:10.1287/moor.19.1.53 · Cited by 354
Efficient interior point methods for multistage problems arising in receding horizon control
Domahidi, A., Zgraggen, A. U., Zeilinger, M. N., Morari, M., & Jones, C. N. (2012) · 2012 IEEE 51st IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426855 · Cited by 338
Self-citationAlgorithm 837: AMD, an approximate minimum degree ordering algorithm
Amestoy, P. R., Davis, T. A., & Duff, I. S. (2004) · ACM Transactions on Mathematical Software · doi:10.1145/1024074.1024081 · Cited by 311
An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control
Patrinos, P., & Bemporad, A. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2275667 · Cited by 287
Symmetric Quasidefinite Matrices
Vanderbei, R. J. (1995) · SIAM Journal on Optimization · doi:10.1137/0805005 · Cited by 202
Interior-Point Methods for Large-Scale Cone Programming
Andersen, M. S., Dahl, J., Liu, Z., & Vandenberghe, L. (2011) · The MIT Press eBooks · doi:10.7551/mitpress/8996.003.0005 · Cited by 130
Davis, T. A. (2005) · ACM Transactions on Mathematical Software · doi:10.1145/1114268.1114277 · Cited by 109
Cited by
Model predictive control: Recent developments and future promise
Mayne, D. Q. (2014) · Automatica · doi:10.1016/j.automatica.2014.10.128 · Cited by 1,975
OSQP: an operator splitting solver for quadratic programs
Stellato, B., Banjac, G., Goulart, P., Bemporad, A., & Boyd, S. (2020) · Mathematical Programming Computation · doi:10.1007/s12532-020-00179-2 · Cited by 1,213
Self-citationAll you need to know about model predictive control for buildings
Drgoňa, J., Arroyo, J., Cupeiro Figueroa, I., Blum, D., Arendt, K., Kim, D., Ollé, E. P., Oravec, J., Wetter, M., Vrabie, D. L., et al. (2020) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2020.09.001 · Cited by 1,020
On the Total Energy Efficiency of Cell-Free Massive MIMO
Ngo, H. Q., Tran, L.-N., Duong, T. Q., Matthaiou, M., & Larsson, E. G. (2018) · IEEE Transactions on Green Communications and Networking · doi:10.1109/tgcn.2017.2770215 · Cited by 863
Dynamic Locomotion in the MIT Cheetah 3 Through Convex Model-Predictive Control
Di Carlo, J., Wensing, P. M., Katz, B., Bledt, G., & Kim, S. (2018) · 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2018.8594448 · Cited by 758
Metadata
- Authors
- Domahidi, A., Chu, E., & Boyd, S.
- Venue
- 2013 European Control Conference (ECC)
- Publisher
- IEEE
- Published
- 2013-07
- Pages
- 3071-3076
- OpenAlex
- W2129516068
- Cited by
- 727
- References
- 22
- FWCI
- 55.89
- Type
- conference paper
- 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.