CVX
CVX is a modeling system for constructing and solving disciplined convex programs (DCPs). CVX supports a number of standard problem types, including linear and quadratic programs (LPs/QPs), second-order cone programs (SOCPs), and semidefinite programs (SDPs). CVX can also solve much more complex convex optimization problems, including many involving nondifferentiable functions, such as ℓ1 norms. You can use CVX to conveniently formulate and solve constrained norm minimization, entropy maximization, determinant maximization, and many other convex programs. As of version 2.0, CVX also solves mixed integer disciplined convex programs (MIDCPs) as well, with an appropriate integer-capable solver.
Keywords for this software
References in zbMATH (referenced in 669 articles , 1 standard article )
Showing results 1 to 20 of 669.
Sorted by year (- Adriaens, Florian; De Bie, Tijl; Gionis, Aristides; Lijffijt, Jefrey; Matakos, Antonis; Rozenshtein, Polina: Relaxing the strong triadic closure problem for edge strength inference (2020)
- Ahmadi, Amir Ali; Hall, Georgina: On the complexity of detecting convexity over a box (2020)
- Aliyev, Nicat; Mehrmann, Volker; Mengi, Emre: Approximation of stability radii for large-scale dissipative Hamiltonian systems (2020)
- Al-Matouq, Ali; Vincent, Tyrone: A convex optimization framework for the identification of homogeneous reaction systems (2020)
- AlMomani, Abd AlRahman R.; Sun, Jie; Bollt, Erik: How entropic regression beats the outliers problem in nonlinear system identification (2020)
- Altıntan, Derya; Koeppl, Heinz: Hybrid master equation for jump-diffusion approximation of biomolecular reaction networks (2020)
- Bhawal, Chayan; Pal, Debasattam; Belur, Madhu N.: Closed-form solutions of singular KYP lemma: strongly passive systems, and fast lossless trajectories (2020)
- Bhowmick, Parijat; Patra, Sourav: Solution to negative-imaginary control problem for uncertain LTI systems with multi-objective performance (2020)
- Budninskiy, Max; Abdelaziz, Ameera; Tong, Yiying; Desbrun, Mathieu: Laplacian-optimized diffusion for semi-supervised learning (2020)
- Ceccon, Francesco; Siirola, John D.; Misener, Ruth: SUSPECT: MINLP special structure detector for Pyomo (2020)
- Cen, Xiaoli; Xia, Yong; Gao, Runxuan; Yang, Tianzhi: On Chebyshev center of the intersection of two ellipsoids (2020)
- Chen, Fei; Ren, Wei: Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints (2020)
- Chen, Ximing; Ogura, Masaki; Preciado, Victor M.: Bounds on the spectral radius of digraphs from subgraph counts (2020)
- Chun, Il Yong; Adcock, Ben: Uniform recovery from subgaussian multi-sensor measurements (2020)
- Chuong, Thai Doan: Semidefinite program duals for separable polynomial programs involving box constraints (2020)
- Coey, Chris; Lubin, Miles; Vielma, Juan Pablo: Outer approximation with conic certificates for mixed-integer convex problems (2020)
- Córdova, Lucía; He, Yifei; Kruczenski, Martin; Vieira, Pedro: The O(N) S-matrix monolith (2020)
- de Klerk, Etienne; Kuhn, Daniel; Postek, Krzysztof: Distributionally robust optimization with polynomial densities: theory, models and algorithms (2020)
- Gouveia, João; Pong, Ting Kei; Saee, Mina: Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices (2020)
- Iwen, Mark A.; Preskitt, Brian; Saab, Rayan; Viswanathan, Aditya: Phase retrieval from local measurements: improved robustness via eigenvector-based angular synchronization (2020)