Sourcify
Effortlessly find and manage open-source dependencies for your projects.

Matlab-based modeling system for disciplined convex programming.

CVX is a Matlab-based modeling system designed for disciplined convex programming. It transforms Matlab into a modeling language, enabling users to specify constraints and objectives using standard Matlab syntax. CVX supports disciplined convex programming, converting expressions into canonical form for efficient solving. It extends functionality to geometric programming (GP) by automatically transforming non-convex GPs into solvable convex forms. Version 2.0 introduced mixed integer disciplined convex programming (MIDCP), allowing for integer and binary variable constraints. While CVX is not a general nonlinear optimization tool, it excels in handling convex models and GPs. Users can leverage the CVX Users’ Guide and example library to get started. It's a powerful tool for optimization tasks, suitable where models can be expressed as MIDCP or GP.
CVX is a Matlab-based modeling system designed for disciplined convex programming.
Explore all tools that specialize in geometric programming. This domain focus ensures CVX delivers optimized results for this specific requirement.
Enforces a strict set of rules to ensure convexity, enabling reliable transformation and solving of convex optimization problems.
Allows modeling of geometric programs in their native non-convex form, with automatic transformation to a convex form for solving.
Extends DCP to include integer and binary variables, enabling modeling of combinatorial optimization problems within a convex framework.
Automatically transforms convex models into a canonical form suitable for solvers, optimizing for performance and compatibility.
Provides a comprehensive collection of example models and applications, showcasing CVX capabilities and providing a starting point for users.
Download and install CVX package for Matlab.
Read the CVX User's Guide to understand its features and syntax.
Explore the example library to get familiar with different optimization models.
Define your convex optimization model using CVX syntax within Matlab.
Use 'cvx_begin' and 'cvx_end' to enclose your model definition.
Specify objective function using 'minimize' or 'maximize'.
Add constraints using standard Matlab relational operators (==, <=, >=).
Run the model within Matlab to obtain the optimized solution.
Verify the solution by analyzing the numerical results and variable values.
All Set
Ready to go
Verified feedback from other users.
"CVX is highly regarded for its ability to simplify the modeling and solving of convex optimization problems within the Matlab environment."
Post questions, share tips, and help other users.
Effortlessly find and manage open-source dependencies for your projects.

End-to-end typesafe APIs made easy.

Page speed monitoring with Lighthouse, focusing on user experience metrics and data visualization.

Topcoder is a pioneer in crowdsourcing, connecting businesses with a global talent network to solve technical challenges.

Explore millions of Discord Bots and Discord Apps.

Build internal tools 10x faster with an open-source low-code platform.

Open-source RAG evaluation tool for assessing accuracy, context quality, and latency of RAG systems.

AI-powered synthetic data generation for software and AI development, ensuring compliance and accelerating engineering velocity.