Babysitter convex-optimization-solver
Solve convex optimization problems efficiently
install
source · Clone the upstream repo
git clone https://github.com/a5c-ai/babysitter
Claude Code · Install into ~/.claude/skills/
T=$(mktemp -d) && git clone --depth=1 https://github.com/a5c-ai/babysitter "$T" && mkdir -p ~/.claude/skills && cp -r "$T/library/specializations/domains/science/mathematics/skills/convex-optimization-solver" ~/.claude/skills/a5c-ai-babysitter-convex-optimization-solver && rm -rf "$T"
manifest:
library/specializations/domains/science/mathematics/skills/convex-optimization-solver/SKILL.mdsource content
Convex Optimization Solver
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