Disciplined Convex Programming
The DOI matches its Crossref record; 170 of the 177 references it cites were found in a registry or an index.
Abstract
SummaryA new methodology for constructing convex optimization models called disciplined convex programming is introduced. The methodology enforces a set of conventions upon the models constructed, in turn allowing much of the work required to analyze and solve the models to be automated.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Specifically, CVX [112] provides a two-stage software framework for modeling and solving general large-scale convex optimization problems.”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [112]
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Self-citationGolub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Linear Matrix Inequalities in System and Control Theory
Boyd, S., El Ghaoui, L., Feron, E., & Balakrishnan, V. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970777 · Cited by 21,687
Self-citation(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
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
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
Anderson, E., Bai, Z., Bischof, C., Blackford, L. S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., et al. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719604 · Cited by 4,435
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
Self-citationLeast Squares Support Vector Machines
Suykens, J. A. K., Van Gestel, T., De Brabanter, J., De Moor, B., & Vandewalle, J. (2002) · WORLD SCIENTIFIC eBooks · doi:10.1142/5089 · Cited by 3,642
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Conn, A. R., Gould, N. I. M., & Toint, P. L. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719857 · Cited by 2,981
Brook, A., Kendrick, D., & Meeraus, A. (1988) · ACM SIGNUM Newsletter · doi:10.1145/58859.58863 · Cited by 2,973
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Gill, P. E., Murray, W., & Saunders, M. A. (2005) · SIAM Review · doi:10.1137/s0036144504446096 · Cited by 2,834
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
Global Optimization with Polynomials and the Problem of Moments
Lasserre, J. B. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623400366802 · Cited by 2,474
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
Convex Analysis and Minimization Algorithms I
Hiriart-Urruty, J.-B., & Lemaréchal, C. (1993) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-02796-7 · Cited by 2,378
Convex Analysis and Optimization
Bertsekas, D. P., Nedić, A., & Ozdaglar, A. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,148
AMPL : a modeling language for mathematical programming
Fourer, R., & Kernighan, B. W. (1993) · Cited by 1,860
Gill, P. E., Murray, W., & Wright, M. H. (2019) · doi:10.1137/1.9781611975604 · Cited by 1,737
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Gill, P. E., Murray, W., & Saunders, M. A. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623499350013 · Cited by 1,587
Semidefinite programming relaxations for semialgebraic problems
Parrilo, P. A. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0387-5 · Cited by 1,527
Linear controller design: limits of performance
Boyd, S., & Barratt, C. H. (1991) · Prentice-Hall, Inc eBooks · Cited by 1,196
Self-citationInterior Point Algorithms: Theory and Analysis
Ye, Y. (1997) · Wiley eBooks · doi:10.1002/9781118032701 · Cited by 939
Self-citationRobust Portfolio Selection Problems
Goldfarb, D., & Iyengar, G. (2003) · Mathematics of Operations Research · doi:10.1287/moor.28.1.1.14260 · Cited by 895
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
Alizadeh, F. (1995) · SIAM Journal on Optimization · doi:10.1137/0805002 · Cited by 892
Convexity and Optimization in Finite Dimensions I
Stoer, J., & Witzgall, C. (1970) · Springer eBooks · doi:10.1007/978-3-642-46216-0 · Cited by 885
A Course in Robust Control Theory
Dullerud, G. E., & Paganini, F. (2000) · Texts in Applied Mathematics · doi:10.1007/978-1-4757-3290-0 · Cited by 769
The path solver: a nommonotone stabilization scheme for mixed complementarity problems
Dirkse, S. P., & Ferris, M. C. (1995) · Optimization Methods and Software · doi:10.1080/10556789508805606 · Cited by 734
Optimal estimation theory for dynamic systems with set membership uncertainty
Milanese, M., & Vicino, A. (1991) · Automatica · doi:10.1016/0005-1098(91)90134-n · Cited by 683
IEEE Transactions on Communications
Haseler, J. B. (1985) · Electronics and Power · doi:10.1049/ep.1985.0368 · Cited by 630
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
Pathways to the Optimal Set in Linear Programming
Megiddo, N. (1989) · Progress in Mathematical Programming · doi:10.1007/978-1-4613-9617-8_8 · Cited by 588
A polynomial-time algorithm, based on Newton's method, for linear programming
Renegar, J. (1988) · Mathematical Programming · doi:10.1007/bf01580724 · Cited by 588
Semidefinite programming for ad hoc wireless sensor network localization
Biswas, P., & Ye, Y. (2004) · Proceedings of the 3rd international symposium on Information processing in sensor networks · doi:10.1145/984622.984630 · Cited by 573
Self-citationOptimal design of a CMOS op-amp via geometric programming
Hershenson, M. D., Boyd, S. P., & Lee, T. H. (2001) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.905671 · Cited by 548
Self-citationAntenna array pattern synthesis via convex optimization
Lebret, H., & Boyd, S. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.558465 · Cited by 520
Self-citationCSDP, A C library for semidefinite programming
Borchers, B. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805765 · Cited by 509 · cited 2×
“Publicly available solvers for SDP and SOCP include SeDuMi [140], CDSP [22], SDPA [58], SDPT3 [152], and DSDP [12].”
MethodTheory and algorithms for linear optimization : an interior point approach
Roos, C., Tamás Terlaky, B., & Vial, J.-P. (1997) · Wiley eBooks · Cited by 506
Control of Uncertain Systems: A Linear Programming Approach
Dahleh, M. A., & Diaz-Bobillo, I. J. (1995) · Medical Entomology and Zoology · Cited by 489
Interior path following primal-dual algorithms. part I: Linear programming
Monteiro, R. D. C., & Adler, I. (1989) · Mathematical Programming · doi:10.1007/bf01587075 · Cited by 486
Alizadeh, F., Haeberly, J.-P. A., & Overton, M. L. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496304700 · Cited by 480
ADIFOR–Generating Derivative Codes from Fortran Programs
Bischof, C., Carle, A., Corliss, G., Griewank, A., & Hovland, P. (1992) · Scientific Programming · doi:10.1155/1992/717832 · Cited by 436
A linear matrix inequality approach to robust H/sub ∞/ filtering
Li, H., & Fu, M. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.622956 · Cited by 414
Improved approximation algorithms for MAXk-CUT and MAX BISECTION
Frieze, A., & Jerrum, M. (1997) · Algorithmica · doi:10.1007/bf02523688 · Cited by 406
Robust Truss Topology Design via Semidefinite Programming
Ben-Tal, A., & Nemirovski, A. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623495291951 · Cited by 378
An Algorithmic Theory of Numbers, Graphs and Convexity
Lovász, L. (1986) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970203 · Cited by 358
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
Self-citationDistinguishing Separable and Entangled States
Doherty, A. C., Parrilo, P. A., & Spedalieri, F. M. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.187904 · Cited by 352 · cited 1×
“robotics 1132, 35, 821; pattern analysis and data mining, including support vector machines [141, 172, 134, 164, 911; combinatorial optimization and graph theory [ lo l l 5, 28, 77, 57, 55, 90, 170, 174, 111, 42, 60, 59, 851; structural optimization [2, 23, 9, 25, 26, 173, 86, 27, 24, 941; algebraic geometry [125, 95,…”
Path-Following Methods for Linear Programming
Gonzaga, C. C. (1992) · SIAM Review · doi:10.1137/1034048 · Cited by 341
Studies in Applied Mathematics
(2010) · Studies in Applied Mathematics · doi:10.1111/(issn)1467-9590 · Cited by 331
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
Feige, U., & Goemans, M. (2002) · Proceedings Third Israel Symposium on the Theory of Computing and Systems · doi:10.1109/istcs.1995.377033 · Cited by 328
Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
Conn, A. R., Gould, N. I. M., & Toint, P. L. (1988) · SIAM Journal on Numerical Analysis · doi:10.1137/0725029 · Cited by 317
Optimization methods for truss geometry and topology design
Bendsøe, M. P., Ben-Tal, A., & Zowe, J. (1994) · Structural Optimization · doi:10.1007/bf01742459 · Cited by 310
Conn, A. R., Gould, N. I. M., & Toint, P. L. (1992) · Springer Series in Computational Mathematics · doi:10.1007/978-3-662-12211-2 · Cited by 295
Optimal linear filtering under parameter uncertainty
Geromel, J. C. (1999) · IEEE Transactions on Signal Processing · doi:10.1109/78.738249 · Cited by 283
A Theoretical Framework for Convex Regularizers in PDE-Based Computation of Image Motion
Weickert, J., & Schnörr, C. (2001) · International Journal of Computer Vision · doi:10.1023/a:1013614317973 · Cited by 280
User's Guide for SOL/NPSOL: A Fortran Package for Nonlinear Programming.
Gill, P. E., Murray, W., Saunders, M. A., & Wright, M. H. (1983) · Cited by 260
Robust H∞ filter design for uncertain linear systems with multiple time-varying state delays
de Soua, C. E., Palhares, R. M., & Peres, P. L. D. (2001) · IEEE Transactions on Signal Processing · doi:10.1109/78.905882 · Cited by 239
Grasp analysis as linear matrix inequality problems
Han, L., Trinkle, J. C., & Li, Z. (2003) · Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C) · doi:10.1109/robot.1999.772534 · Cited by 238
H/sub 2/ and H/sub ∞/ robust filtering for convex bounded uncertain systems
Geromel, J. C., & De Oliveira, M. C. (2001) · IEEE Transactions on Automatic Control · doi:10.1109/9.898699 · Cited by 237
Grasp analysis as linear matrix inequality problems
Han, L., Trinkle, J. C., & Li, Z. X. (2000) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.897778 · Cited by 223
Duality Relationships for Entropy-Like Minimization Problems
Borwein, J. M., & Lewis, A. S. (1991) · SIAM Journal on Control and Optimization · doi:10.1137/0329017 · Cited by 211
Robust and reduced-order filtering: new LMI-based characterizations and methods
Tuan, H. D., Apkarian, P., & Nguyen, T. Q. (2001) · IEEE Transactions on Signal Processing · doi:10.1109/78.969506 · Cited by 208
Robust Kalman filters for linear time-varying systems with stochastic parametric uncertainties
Wang, F., & Balakrishnan, V. (2002) · IEEE Transactions on Signal Processing · doi:10.1109/78.992124 · Cited by 202
Robust ℋ/sub ∞/ filtering for uncertain discrete-time state-delayed systems
Palhares, R. M., de Souza, C. E., & Dias Peres, P. L. (2001) · IEEE Transactions on Signal Processing · doi:10.1109/78.934139 · Cited by 189
Geometric Programming: Methods, Computations and Applications
Ecker, J. G. (1980) · SIAM Review · doi:10.1137/1022058 · Cited by 189
The application of semidefinite programming for detection in CDMA
Tan, P. H., & Rasmussen, L. K. (2001) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.942507 · Cited by 183
(1990) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4757-2108-9 · Cited by 182
Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
Feige, U., & Langberg, M. (2001) · Journal of Algorithms · doi:10.1006/jagm.2001.1183 · Cited by 175
An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems
Kojima, M., Mizuno, S., & Yoshise, A. (1991) · Mathematical Programming · doi:10.1007/bf01594942 · Cited by 173
SDPT3 — a Matlab software package for semidefinite-quadratic-linear programming, version 3.0
Tütüncü, R. H., Toh, K.-C., & Todd, M. J. (2001) · Cited by 168
A new H/sub ∞/ filter design for linear time delay systems
Fridman, E., & Shaked, U. (2001) · IEEE Transactions on Signal Processing · doi:10.1109/78.960431 · Cited by 167
A New Method for Optimal Truss Topology Design
Ben-Tal, A., & Bendsøe, M. P. (1993) · SIAM Journal on Optimization · doi:10.1137/0803015 · Cited by 166
Interior path following primal-dual algorithms
Monteiro, R. D. C., & Adler, I. (1988) · Cited by 163
FIR Filter Design via Spectral Factorization and Convex Optimization
Wu, S.-P., Boyd, S., & Vandenberghe, L. (1999) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-0571-5_5 · Cited by 155
Self-citationOptimization of inductor circuits via geometric programming
Hershenson, M. D. M., Mohan, S. S., Boyd, S., & Lee, T. H. (1999) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/309847.310112 · Cited by 154
Self-citationAn infeasible interior-point algorithm for solving primal and dual geometric programs
Kortanek, K. O., Xu, X., & Ye, Y. (1997) · Mathematical Programming · doi:10.1007/bf02614382 · Cited by 145
Self-citationZwick, U. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/301250.301431 · Cited by 141
Progress in Mathematical Programming: Interior-Point and Related Methods
Megiddo, N. (2011) · Cited by 140
Byrd, R. H., Gould, N. I. M., Nocedal, J. M., & Waltz, R. A. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0485-4 · Cited by 139
A path to the Arrow–Debreu competitive market equilibrium
Ye, Y. (2006) · Mathematical Programming · doi:10.1007/s10107-006-0065-5 · Cited by 132
Self-citationFree material optimization via mathematical programming
Zowe, J., Kočvara, M., & Bendsøe, M. P. (1997) · Mathematical Programming · doi:10.1007/bf02614328 · Cited by 130
Linearizing Geometric Programs
Duffin, R. J. (1970) · SIAM Review · doi:10.1137/1012043 · Cited by 127 · cited 1×
“GPs have been used in various fields since the late 1960s [48].”
BackgroundA matrix-algebraic approach to linear parallel interference cancellation in CDMA
Guo, D., Rasmussen, L. K., Sun, S., & Lim, T. J. (2000) · IEEE Transactions on Communications · doi:10.1109/26.818883 · Cited by 127
H/sub ∞/ filtering of 2-D discrete systems
Du, C., Xie, L., & Soh, Y. C. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.845933 · Cited by 123
Equivalent displacement based formulations for maximum strength truss topology design
Achtziger, W., Bendsøe, M. P., Ben‐Tal, A., & Zowe, J. (1992) · IMPACT of Computing in Science and Engineering · doi:10.1016/0899-8248(92)90005-s · Cited by 123
A matrix-algebraic approach to successive interference cancellation in CDMA
Rasmussen, L. K., Lim, T. J., & Johansson, A. (2000) · IEEE Transactions on Communications · doi:10.1109/26.818882 · Cited by 123
Solution of generalized geometric programs
Avriel, M., Dembo, R. S., & Passy, U. (1975) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.1620090112 · Cited by 123
Convex optimization problems involving finite autocorrelation sequences
Alkire, B., & Vandenberghe, L. (2002) · Mathematical Programming · doi:10.1007/s10107-002-0334-x · Cited by 119
Finite-horizon robust Kalman filter design
Fu, M., de Souza, C. E., & Luo, Z.-Q. T. (2001) · IEEE Transactions on Signal Processing · doi:10.1109/78.942638 · Cited by 117
On the Sum of the Largest Eigenvalues of a Symmetric Matrix
Overton, M. L., & Womersley, R. S. (1992) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0613006 · Cited by 115
Robust mixed ℋ/sub 2//ℋ/sub ∞/ filtering of 2-D systems
Tuan, H. D., Apkarian, P., Nguyen, T. Q., & Narikiyo, T. (2002) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2002.1011215 · Cited by 112
A unified approach for the design of 2-D digital filters via semidefinite programming
Lu, W.-S. (2002) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/tcsi.2002.1010036 · Cited by 106 · cited 1×
“…KZN00]; • algebraic geometry [Par03, Las01, Las02b],[Las02a]; • signal processing [HF97, WBV98, Ger99, SMM00, TSX00a, WXZ00, DXS00, TSX00b, AV02, DTS01, Lu02, SXS01, FdL01, TAN01, FS01, TC01, MD01, MB01, PdP01, DXS01, PP01, dPP01, BK01, GO01, YH02, WB02, TANN02, ZXZ02]; • communications…”
Binary partitioning, perceptual grouping, and restoration with semidefinite programming
Keuchel, J., Schnörr, C., Schellewald, C., & Cremers, D. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1240111 · Cited by 104
New approaches to robust minimum variance filter design
Shaked, U., Xie, L., & Soh, Y. C. (2001) · IEEE Transactions on Signal Processing · doi:10.1109/78.960408 · Cited by 104
Obstacle Collision Detection Using Best Ellipsoid Fit
Rimon, E., & Boyd, S. (1997) · Journal of Intelligent & Robotic Systems · doi:10.1023/a:1007960531949 · Cited by 103
Self-citationMA estimation in polynomial time
Stoica, P., McKelvey, T., & Mari, J. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.847786 · Cited by 103
Semidefinite Programming vs. LP Relaxations for Polynomial Programming
Lasserre, J. B. (2002) · Mathematics of Operations Research · doi:10.1287/moor.27.2.347.322 · Cited by 101
Derandomizing Approximation Algorithms Based on Semidefinite Programming
Mahajan, S., & Ramesh, H. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539796309326 · Cited by 99
LMI approach to the mixed H/sub 2//H/sub ∞/ filtering design for discrete-time uncertain systems
Palhares, R. M., & Peres, P. L. D. (2001) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/7.913689 · Cited by 98
Boyd, S., & Vandenberghe, L. (1997) · Springer eBooks · doi:10.1007/978-1-4615-6281-8_15 · Cited by 95
Self-citationOn a homogeneous algorithm for the monotone complementarity problem
Andersen, E. D., & Ye, Y. (1999) · Mathematical Programming · doi:10.1007/s101070050027 · Cited by 90
Self-citationKleinberg, J. M., Papadimitriou, C. H., & Raghavan, P. (1998) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/276698.276860 · Cited by 90
H/sub ∞/ fuzzy estimation for a class of nonlinear discrete-time dynamic systems
Tseng, C., & Chen, B.-S. (2001) · IEEE Transactions on Signal Processing · doi:10.1109/78.960407 · Cited by 89
On the parameterization of positive real sequences and MA parameter estimation
Dumitrescu, B., Tabus, I., & Stoica, P. (2001) · IEEE Transactions on Signal Processing · doi:10.1109/78.960409 · Cited by 83
A primal-dual trust-region algorithm for non-convex nonlinear programming
Conn, A. R., Gould, N. I. M., Orban, D., & Toint, P. L. (2000) · Mathematical Programming · doi:10.1007/s101070050112 · Cited by 82
Optimal Truss Design by Interior-Point Methods
Jarre, F., Kočvara, M., & Zowe, J. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496297097 · Cited by 81
van der Schaft, A. J., & van der (2001) · University of Twente Research Information · Cited by 78
Freund, R. M. (1991) · Mathematical Programming · doi:10.1007/bf01586933 · Cited by 78
An improved rounding method and semidefinite programming relaxation for graph partition
Han, Q., Ye, Y., & Zhang, J. (2002) · Mathematical Programming · doi:10.1007/s101070100288 · Cited by 76
Self-citationYang, F., & Hung, Y. S. (2002) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/tcsi.2002.801267 · Cited by 73
Derandomizing semidefinite programming based approximation algorithms
Mahajan, S., & Ramesh, H. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1995.492473 · Cited by 68
Design of orthogonal pulse shapes for communications via semidefinite programming
Davidson, T. N., Luo, Z.-Q. T., & Wong, K. M. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.839988 · Cited by 67
The RPR2 rounding technique for semidefinite programs
Feige, U., & Langberg, M. (2004) · Journal of Algorithms · doi:10.1016/j.jalgor.2004.11.003 · Cited by 65
A Barrier Method for Large-Scale Constrained Optimization
Nash, S. G., & Sofer, A. (1993) · INFORMS journal on computing · doi:10.1287/ijoc.5.1.40 · Cited by 64
LAPACK users` guide: Release 1.0
Lab., I. (. S. A. N., Anderson, E., USDOE, W., Bai, Z., Bischof, C., Demmel, J., Dongarra, J. J., Croz, J. D., Greenbaum, A., Hammarling, S. J., et al. (1992) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/10136133 · Cited by 62
Bounds on measures satisfying moment conditions
Lasserre, J. B. (2002) · The Annals of Applied Probability · doi:10.1214/aoap/1031863183 · Cited by 62
Free Material Design via Semidefinite Programming: The Multiload Case with Contact Conditions
Ben‐Tal, A., Kočvara, M., Nemirovski, A. S., & Zowe, J. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623497327994 · Cited by 56
Optimizing dominant time constant in RC circuits
Vandenberghe, L., Boyd, S., & Gamal, A. E. (1998) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.681261 · Cited by 55
Self-citationH/sub ∞/ reduced-order approximation of 2-D digital filters
Du, H., Xie, L., & Soh, Y. C. (2001) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/81.928152 · Cited by 49
Bahn, O., Goffin, J., Vial, J. ‐., & du Merle, O. (1994) · Discrete Applied Mathematics · doi:10.1016/0166-218x(94)90198-8 · Cited by 49
Potential Reduction Polynomial Time Method for Truss Topology Design
Ben‐Tal, A., & Nemirovski, A. S. (1994) · SIAM Journal on Optimization · doi:10.1137/0804033 · Cited by 46
Some properties of the Hessian of the logarithmic barrier function
Wright, M. H. (1994) · Mathematical Programming · doi:10.1007/bf01582224 · Cited by 43
Robust ℋ/sub ∞/ filtering for a class of linear parameter-varying systems
Mahmoud, M. S., & Boujarwah, A. S. (2001) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/81.948442 · Cited by 41
Bertsimas, D., & Niño‐Mora, J. (1999) · Mathematics of Operations Research · doi:10.1287/moor.24.2.306 · Cited by 40
On Formulating Semidefinite Programming Problems as Smooth Convex Nonlinear Optimization Problems
Vanderbei, R. J., & Benson, H. Y. (2000) · Cited by 36
Abdi, M. J., Nahas, H. E., Jard, A., & Moulines, É. (2002) · IEEE Signal Processing Letters · doi:10.1109/lsp.2002.800508 · Cited by 34
Reduced-Order Approximation of 2-D Digital Filters
Du, C., Xie, L., & Soh, Y. C. (2001) · Cited by 33
LOQO User’s Manual – Version 4.05
Vanderbei, R. J., & Versión, . (2006) · Cited by 31
Bertsimas, D., & Niño‐Mora, J. (1999) · Mathematics of Operations Research · doi:10.1287/moor.24.2.331 · Cited by 31
Approximation of Dense-n/2-Subgraph and the Complement of Min-Bisection
Ye, Y., & Zhang, J. (2003) · Journal of Global Optimization · doi:10.1023/a:1021390231133 · Cited by 30
Self-citationSelf-Scaled Barrier Functions on Symmetric Cones and Their Classification
Hauser, R., & Güler, O. (2002) · Foundations of Computational Mathematics · doi:10.1007/s102080010022 · Cited by 29
Optimal wire and transistor sizing for circuits with non-tree topology
Vandenberghe, L., Boyd, S., & Gamal, A. E. (1997) · International Conference on Computer Aided Design · doi:10.5555/266388.266485 · Cited by 29
Self-citationH/sub 2/ optimal inverse of periodic FIR digital filters
Wang, S., Xie, L., & Zhang, C. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.863088 · Cited by 28
Optimal allocation of local feedback in multistage amplifiers via geometric programming
Dawson, J. L., Boyd, S., Hershenson, M. D. M., & Lee, T. H. (2001) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/81.903183 · Cited by 28
Self-citationOptimal wire and transistor sizing for circuits with non-tree topology
Vandenberghe, Boyd, S., & Gamal, E. (1997) · International Conference on Computer Aided Design · doi:10.1109/iccad.1997.643528 · Cited by 28
Self-citationsdpsol: a parse/solver for semidefinite programs with matrix structure
Wu, S.-P., & Boyd, S. (1999) · Society for Industrial and Applied Mathematics eBooks · Cited by 26
Self-citationCascading — an approach to robust material optimization
Kočvara, M., Zowe, J., & Nemirovski, A. S. (2000) · Computers & Structures · doi:10.1016/s0045-7949(99)00173-x · Cited by 24
Global chaos synchronization and robust filtering in noisy context
Millérioux, G., & Daafouz, J. (2001) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/81.956011 · Cited by 24
A New Self-Dual Embedding Method for Convex Programming
Zhang, S. (2004) · Journal of Global Optimization · doi:10.1023/b:jogo.0000047915.10754.a1 · Cited by 22
Free Material Design via Semidefinite Programming: The Multiload Case with Contact Conditions
Ben‐Tal, A., Kovara, M., Nemirovski, A. S., & Zowe, J. (2000) · SIAM Review · doi:10.1137/s0036144500372081 · Cited by 22
Linear controller design limits of performance
Mareels, I. (1993) · Automatica · doi:10.1016/0005-1098(93)90084-7 · Cited by 21
Schellewald, C., Roth, S., & Schnörr, C. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45404-7_48 · Cited by 20
Analysis and optimization of the Williams‐Otto process by geometric programming
Rijckaert, M. J., & Martens, X. M. (1974) · AIChE Journal · doi:10.1002/aic.690200416 · Cited by 19
A direct approach to H/sub 2/ optimal deconvolution of periodic digital channels
Zhou, H., Xie, L., & Zhang, C. (2002) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2002.1011209 · Cited by 19
A Practical Interior-Point Method for Convex Programming
Jarre, F., & Saunders, M. A. (1995) · SIAM Journal on Optimization · doi:10.1137/0805008 · Cited by 18
Robust calibration and control of robotic manipulators
Calafiore, G. C., & Indri, M. (2000) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2000.879552 · Cited by 17
A mixed norm performance measure for the design of multirate filterbanks
Banavar, R. N., & Kalele, A. (2001) · IEEE Transactions on Signal Processing · doi:10.1109/78.902117 · Cited by 16
4. sdpsol: A Parser/Solver for Semidefinite Programs with Matrix Structure
Wu, S.-P., & Boyd, S. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719833.ch4 · Cited by 16
Self-citationBen‐Tal, A., & Nemirovski, A. S. (2000) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-1-4615-4381-7_15 · Cited by 16
Primal-dual interior-point methods
Tunçel, L. (2010) · American Mathematical Society eBooks · doi:10.1090/fim/027/04 · Cited by 15
Convexity Determination in the Microsoft Excel Solver Using Automatic Differentiation Techniques
Nenov, I. P., Fylstra, D. H., & Kolev, L. V. (2004) · Cited by 13
Envelope-constrained H/sub ∞/ filter design: An LMI optimization approach
Tan, Z., Soh, Y. C., & Xie, L. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.869058 · Cited by 12
Duality and Self-Duality for Conic Convex Programming
Luo, Z.-Q. T., Sturm, J. F., & Zhang, S. (1996) · Cited by 12
2-Catalog segmentation problem
Dodis, Y., Guruswami, V., & Khanna, S. (1999) · Cited by 12
Homogeneous analytic center cutting plane methods with approximate centers
Nesterov, Y. E., Péton, O., & Vial, J.-P. (1999) · Optimization methods & software · doi:10.1080/10556789908805753 · Cited by 11
Envelope-constrained H/sub ∞/ FIR filter design
Tan, Z., Soh, Y. C., & Xie, L. (2000) · IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing · doi:10.1109/82.818899 · Cited by 10
Design of GBSB neural associative memories using semidefinite programming
Prk, J., Cho, H., & Park, D. (1999) · IEEE Transactions on Neural Networks · doi:10.1109/72.774268 · Cited by 9
On Convergence of Minimization Methods: Attraction, Repulsion, and Selection
Zhang, Y., Tapia, R. A., & Velázquez, L. (2000) · Journal of Optimization Theory and Applications · doi:10.1023/a:1026443131121 · Cited by 8
Fiege, L., Wilhelm, U., & Mühl, G. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45598-1 · Cited by 4
DrAmpl - A meta solver for optimization
Fourer, R., & Orban, D. (2007) · PolyPublie (École Polytechnique de Montréal) · Cited by 2
Globally convergent algorithms for convex programming with applications to geometric programming
Rosenberg, E. (1979) · Cited by 2
On Conically Ordered Convex Programs
Zhang, S. (2004) · Cited by 2
Research works printed but not linked: 9
- D. Bertsekas. Nonlinear Programming. Athena Scientific, Belmont, Massachusetts, 1995.
- C. Crusius. A parser/solver for convex optimization problems. PhD thesis, Stanford University, 2002.
- D. Goldfarb and G. Iyengar. Robust quadratically constrained problems program. Technical Report TR-2002-04, Department of IEOR, Columbia University, New York, NY USA, 2002.
- M. Grant. Disciplined Convex Programming. PhD thesis, Department of Electrical Engineering, Stanford University, December 2004.
- J.-B. Hiriart-Urruty and C. Lemaréchal. Convex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods, volume 306 of Grundlehren der mathematischen Wissenschaften. Springer-Verlag, New York, 1993.
- B. Murtaugh and M. Saunders. MINOS 5.5 user’s guide. Technical report, Systems Optimizaiton Laboratory, Stanford University, July 1998. Web site: http://www.sbsi-sol-optimize.com/manuals/Minos%205-5%20Manual.p%df.
- Yu. Nesterov and A. Nemirovsky. A general approach to polynomial-time algorithms design for convex programming. Technical report, Centr. Econ. & Math. Inst., USSR Acad. Sci., Moscow, USSR, 1988.
- G. Pataki. Geometry of cone-optimization problems and semi-definite programs. Technical report, GSIA Carnegie Mellon University, Pittsburgh, PA, 1994.
- T. Tsuchiya. A polynomial primal-dual path-following algorithm for second-order cone programming. Technical report, The Institute of Statistical Mathematics, Tokyo, Japan, October 1997.
Cited by
Graph Implementations for Nonsmooth Convex Programs
Grant, M. C., & Boyd, S. P. (2007) · Lecture Notes in Control and Information Sciences · doi:10.1007/978-1-84800-155-8_7 · Cited by 2,666
“Disciplined convex programming was first named and described by Grant, Boyd, and Ye in [GBY06] and Grant in [Gra04].”
BackgroundSelf-citationCVXPY: A Python-Embedded Modeling Language for Convex Optimization.
Diamond, S., & Boyd, S. (2016) · PubMed · Cited by 1,648
Self-citationJuMP: A MODELING LANGUAGE FOR MATHEMATICAL OPTIMIZATION
Dunning, I., Huchette, J., & Lubin, M. (2016) · Cited by 1,357
Simultaneously Transmitting and Reflecting (STAR) RIS Aided Wireless Communications
Mu, X., Liu, Y., Guo, L., Lin, J., & Schober, R. (2022) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3118225 · Cited by 896
Edge artificial intelligence for 6g: vision, enabling technologies, and applications
Letaief, K. B., Shi, Y., Lu, J., & Lu, J. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3126076 · Cited by 829
Metadata
- Authors
- Grant, M., Boyd, S., & Ye, Y.
- Affiliations
- Stanford University (US)
- Venue
- Nonconvex Optimization and Its Applications
- Publisher
- Kluwer Academic Publishers
- Published
- 2006-06-20
- Pages
- 155-210
- OpenAlex
- W2178935672
- Cited by
- 1,026
- References
- 177
- Citations by year
- 2026: 32 · 2025: 116 · 2024: 126 · 2023: 115 · 2022: 247 · 2021: 111 · 2020: 30 · 2019: 33 · 2018: 26 · 2017: 15 · 2016: 26 · 2015: 26 · 2014: 27 · 2013: 15 · 2012: 12
- FWCI
- 26.01
- Type
- book chapter
- Language
- en
- Open access
- closed
- Locations
- Kluwer Academic Publishers eBooks (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- Social Sciences › Decision Sciences › Management Science and Operations Research › Risk and Portfolio Optimization
- Keywords
- convex optimization
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.