Convex Optimization Solver

SkillDev tools

Solve convex optimization problems efficiently

Instructions available. Your AI can read the instructions. Execution depends on the setup they require.

Account requirements not reviewed. Check the skill instructions before use; ahel provides instructions and does not run this skill.

Add ahel to your AI once: Claude, ChatGPT, Cursor, Claude Code or Codex. Then ask it to use this.

Then ask your AI: use the Convex Optimization Solver skill

What this skill tells your AI

The instructions your AI receives, as published by a5c-ai/babysitter in library/specializations/domains/science/mathematics/skills/convex-optimization-solver/SKILL.md and read by ahel’s review.

Purpose

Provides capabilities for formulating and solving convex optimization problems efficiently and reliably.

Capabilities

Linear programming (LP)
Quadratic programming (QP)
Second-order cone programming (SOCP)
Semidefinite programming (SDP)
Conic optimization
Duality analysis

Usage Guidelines

Convexity Verification: Confirm problem convexity
Formulation: Express problem in standard conic form
Solver Selection: Choose solver based on problem structure
Duality: Extract dual variables for sensitivity analysis

Tools/Libraries

CVXPY
Gurobi
MOSEK
SCS
ECOS

Signals

GitHub stars: 2k
Forks: 112
Last commit: Sep 2026

Advanced

Item type: skill
Key: convex-optimization-solver
Source: github.com/a5c-ai/babysitter

github.com/a5c-ai/babysitter