SkillAgentSearch skills...

convex-optimization

Problem-solving strategies for convex optimization in optimization

Install / Use

npx skills add parcadei/Continuous-Claude-v3 --skill convex-optimization

Installs into whichever agent you are using.

About this skill
📄

SKILL.md

Installable skill definition

Quality Score

82/100

Supported Platforms

Universal

Tags

Our assessment of convex-optimization

convex-optimization scores 82/100 on our quality scale, 62nd of 82 Project & Program Management skills we index.

Its SKILL.md is 3.5 KB long, well organised into 9 sections with 3 code examples: a solid amount of guidance for an agent.

With 3,943 GitHub stars, it is one of the more widely adopted skills in the catalogue.

Substance
26/30
Structure
18/20
Description
12/15
Adoption
15/20
Freshness
11/15

Maintenance, license and trust

  • The repository was last updated about 10 months ago. That is recent enough to be usable, but agent tooling moves fast, so check the instructions against your agent's current version.
  • Our last check on 2026-11-07 found the source still online.
  • It is released under the MIT license, a permissive license that allows use, modification and commercial use with attribution.
  • Its trust signals score 94/100, with 1 caution from licensing, adoption, age or documentation. These come from repository metadata, not a code audit — read the skill file before letting an agent act on it.

Safety scan

No issues found

Our scan of the whole file found no instruction hijacking, hidden characters, credential access, data exfiltration or destructive commands. An AI review of the same text found nothing harmful.

AI review by kimi-k2.7-code on 2026-10-01. Automated pattern scan on 2026-10-01. It catches known dangerous patterns, not every risk — read a skill before letting an agent act on it.

convex-optimization compared with similar skills

All 4 of these similar skills score higher than convex-optimization; compare them before choosing.

SkillScoreStarsUpdatedFormat
convex-optimization (this skill)by parcadei823.9k10mo agoSKILL.md
x402by browser-use100121.0k3d agoSKILL.md
algorithmic-artby anthropics100177.9k55d agoSKILL.md
pptxby anthropics100177.9k55d agoSKILL.md
designby nextlevelbuilder100149.0k6d agoSKILL.md

Frequently asked questions

How do I install convex-optimization?
Run npx skills add parcadei/Continuous-Claude-v3 --skill convex-optimization. The install tabs above show the steps for each supported agent.
Which AI agents does convex-optimization work with?
It is written for Universal, as a SKILL.md file. Other agents that read the same format can often use it too.
Is convex-optimization safe to use?
Our scan of the whole file found no instruction hijacking, hidden characters, credential access, data exfiltration or destructive commands. An AI review of the same text found nothing harmful. It is MIT-licensed and scores 94/100 on trust signals. Skills are instructions an agent will follow, so read the file before installing it and do not approve commands you do not understand.
Is convex-optimization still maintained?
The repository was last updated about 10 months ago. That is recent enough to be usable, but agent tooling moves fast, so check the instructions against your agent's current version.

name: convex-optimization description: "Problem-solving strategies for convex optimization in optimization" allowed-tools: [Bash, Read]

Convex Optimization

When to Use

Use this skill when working on convex-optimization problems in optimization.

Decision Tree

  1. Verify Convexity

    • Objective function: Hessian positive semidefinite?
    • Constraint set: intersection of convex sets?
    • z3_solve.py prove "hessian_psd"
  2. Problem Classification | Type | Solver | |------|--------| | Linear Programming | scipy.optimize.linprog | | Quadratic Programming | scipy.optimize.minimize(method='SLSQP') | | General Convex | Interior point methods | | Semidefinite | CVXPY with SDP solver |

  3. Standard Form

    • minimize f(x) subject to g_i(x) <= 0, h_j(x) = 0
    • Convert max to min by negating
    • Convert >= to <= by negating
  4. KKT Conditions (Necessary & Sufficient)

    • Stationarity: grad L = 0
    • Primal feasibility: g_i(x) <= 0, h_j(x) = 0
    • Dual feasibility: lambda_i >= 0
    • Complementary slackness: lambda_i * g_i(x) = 0
    • z3_solve.py prove "kkt_conditions"
  5. Solve and Verify

    • scipy.optimize.minimize(f, x0, constraints=cons)
    • Check constraint satisfaction
    • Verify solution is global minimum (convex guarantees this)

Tool Commands

Scipy_Linprog

uv run python -c "from scipy.optimize import linprog; res = linprog([-1, -2], A_ub=[[1, 1], [2, 1]], b_ub=[4, 5]); print('Optimal:', -res.fun, 'at x=', res.x)"

Scipy_Minimize

uv run python -c "from scipy.optimize import minimize; res = minimize(lambda x: (x[0]-1)**2 + (x[1]-2)**2, [0, 0]); print('Minimum at', res.x)"

Z3_Kkt

uv run python -m runtime.harness scripts/z3_solve.py prove "kkt_conditions"

Key Techniques

From indexed textbooks:

  • [Additional Exercises for Convex Optimization (with] Finally, there are lots of methods that will do better than this, usually by taking this as a starting point and ‘polishing’ the result after that. Several of these have been shown to give fairly reliable, if modest, improvements. You were not required to implement any of these methods.
  • [Additional Exercises for Convex Optimization (with] K { X = x Ax yi } where e is the p-dimensional vector of ones. This is a polyhedron and thus a convex set. Rm has the form − The residual Aˆx − Describe a heuristic method for approximately solving this problem, using convex optimization.
  • [Additional Exercises for Convex Optimization (with] We then pick a small positive number , and a vector c cT x minimize subject to fi(x) 0, hi(x) = 0, f0(x) ≤ p + . There are dierent strategies for choosing c in these experiments. The simplest is to choose the c’s randomly; another method is to choose c to have the form ei, for i = 1, .
  • [Additional Exercises for Convex Optimization (with] We formulate the solution as the following bi-criterion optimization problem: (J ch, T ther) cmax, cmin, 0, minimize subject to c(t) c(t) a(k) ≤ ≥ t = 1, . T The key to this problem is to recognize that the objective T ther is quasiconvex. The problem as stated is convex for xed values of T ther.
  • [nonlinear programming_tif] Optimization Over a Convex Set** - Focuses on optimization problems constrained within a convex set. Optimality Conditions:** Similar to unconstrained optimization, but within the context of convex sets. Feasible Directions and Conditional Gradient** - Explores methods that ensure feasibility within constraints.

Cognitive Tools Reference

See .claude/skills/math-mode/SKILL.md for full tool documentation.

Related Skills

View on GitHub
GitHub Stars3.9k
CategoryProject
Updated9mo ago
Forks303

Languages

Python

Trust signals

94/100

From repository metadata: license, adoption, age and documentation. Not a code audit — see the Safety scan above for what the skill file itself contains.

1 low
convex-optimization — Universal Skill: Install & Safety Check | SkillAgent