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 300 articles , 1 standard article )
Showing results 1 to 20 of 300.
Sorted by year (- Bai, Yanqin; Wei, Yudan; Li, Qian: An optimal trade-off model for portfolio selection with sensitivity of parameters (2017)
- Bhowmick, Parijat; Patra, Sourav: An observer-based control scheme using negative-imaginary theory (2017)
- Bongini, Mattia; Fornasier, Massimo; Hansen, Markus; Maggioni, Mauro: Inferring interaction rules from observations of evolutive systems. I: The variational approach. (2017)
- Borcea, Liliana; Kocyigit, Ilker: Imaging in random media with convex optimization (2017)
- Chao, Hsiao-Han; Vandenberghe, Lieven: Semidefinite representations of gauge functions for structured low-rank matrix decomposition (2017)
- Chen, Bilian; He, Simai; Li, Zhening; Zhang, Shuzhong: On new classes of nonnegative symmetric tensors (2017)
- Chuong, T.D.; Jeyakumar, V.: A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals (2017)
- Cox, Bruce; Juditsky, Anatoli; Nemirovski, Arkadi: Decomposition techniques for bilinear saddle point problems and variational inequalities with affine monotone operators (2017)
- Ding, Chao; Qi, Hou-Duo: Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation (2017)
- Dumitrescu, Bogdan: Positive trigonometric polynomials and signal processing applications (2017)
- Dunning, Iain; Huchette, Joey; Lubin, Miles: JuMP: a modeling language for mathematical optimization (2017)
- Fawzi, Hamza; Saunderson, James: Lieb’s concavity theorem, matrix geometric means, and semidefinite optimization (2017)
- Gao, Lucy L.; Zhou, Julie: D-optimal designs based on the second-order least squares estimator (2017)
- Gotoh, Jun-ya; Uryasev, Stan: Support vector machines based on convex risk functions and general norms (2017)
- Haesaert, Sofie; Zadeh Soudjani, Sadegh Esmaeil; Abate, Alessandro: Verification of general Markov decision processes by approximate similarity relations and policy refinement (2017)
- Harwood, Stuart M.; Barton, Paul I.: How to solve a design centering problem (2017)
- Iervolino, Raffaele; Tangredi, Domenico; Vasca, Francesco: Lyapunov stability for piecewise affine systems via cone-copositivity (2017)
- Iwen, Mark; Viswanathan, Aditya; Wang, Yang: Robust sparse phase retrieval made easy (2017)
- Jadamba, B.; Khan, A.; Sama, M.: Error estimates for integral constraint regularization of state-constrained elliptic control problems (2017)
- Liu, Zisheng; Li, Jicheng; Li, Wenbo; Dai, Pingfan: A modified greedy analysis pursuit algorithm for the cosparse analysis model (2017)