Every premium and members-only resource for $9.99/month, as a no-commitment subscription. See the plans

PalateKit

Menu

Request a resource

Describe the resource you are missing in one sentence. We will email you when it is published.

0 / 280

Unlock PalateKit

Unlock everything

Plan

Paying means accepting our terms of sale.

Secure payment by Stripe. Receipts and invoices sent by email.

Welcome back

Sign in to install, download or save this resource. A free account is enough for free resources.

Convex optimization: convexity and solver choice v1.0.0

Use this resource to check convexity and choose a solver for an optimization problem

New

  • 457 downloads
  • 161 likes
  • 151 saves

Free

Install with the CLI

In a terminal, from the folder you want:

npx --yes palatekit@latest install convex-optimization-solver-choice

With no option, the skill goes to ~/.agents/skills/; add --agent claude-code (or codex, cursor…) to target an agent.

First time: connect the CLI with

npx --yes palatekit@latest login

The agent follows a decision tree: it checks convexity of the objective and of the constraint set, then classifies the problem (linear, quadratic, general convex, semidefinite). It then points to the matching solver with its SciPy or CVXPY commands. You get a structured method and the commands to run.

Mostly picked by

Updated November 2, 2026

Card for the “Convex optimization: convexity and solver choice” skill

Details

Generates with
Your agent's model
Licence
MIT

Similar resources

View all
  • Free

    Skills

    Knowledge wiki setup

    • 418418 downloads
    • 129129 likes
    • 161161 saves
    Works with
    • Claude Code
    • Codex
    • Cursor
    • and 3 more
  • Free

    Skills

    Wiki health check

    • 552552 downloads
    • 202202 likes
    • 127127 saves
    Works with
    • Claude Code
    • Codex
    • Cursor
    • and 3 more
  • Free

    Skills

    Ask your wiki

    • 374374 downloads
    • 131131 likes
    • 214214 saves
    Works with
    • Claude Code
    • Codex
    • Cursor
    • and 3 more
  • Free

    Skills

    Wiki source ingestion

    • 315315 downloads
    • 230230 likes
    • 246246 saves
    Works with
    • Claude Code
    • Codex
    • Cursor
    • and 3 more
  • Free

    Skills

    Wiki auditor agent

    • 556556 downloads
    • 205205 likes
    • 192192 saves
    Works with
    • Claude Code
    • Codex
    • Cursor
    • and 3 more
  • Free

    Skills

    UX research assistant

    • 598598 downloads
    • 142142 likes
    • 236236 saves
    Works with
    • Claude Code
    • Codex
    • Cursor
    • and 3 more
  • Free

    Skills

    Wiki ingestion agent

    • 437437 downloads
    • 162162 likes
    • 191191 saves
    Works with
    • Claude Code
    • Codex
    • Cursor
    • and 3 more
  • Free

    Skills

    Wiki librarian agent

    • 304304 downloads
    • 120120 likes
    • 217217 saves
    Works with
    • Claude Code
    • Codex
    • Cursor
    • and 3 more

What you get

  • SKILL.md: decision tree, problem classification and solver table
  • SKILL.md: SciPy, CVXPY and Z3 commands for each problem type

Good fit for

  • You need to minimize a cost under linear or quadratic constraints
  • You want to confirm a problem is convex before choosing a solver

Not for

    Tags

    • convex optimization
    • linear programming
    • solver
    • mathematics

    About

    You say

    “Is this minimization problem with quadratic constraints convex, and which solver should I use?”

    Card for the “Convex optimization: convexity and solver choice” skill

    Skill published by parcadei under the MIT license, delivered in its original version.

    Show more

    How to use it

    1. Install the skill in your agent's skills folder
    2. Ask your agent to check convexity and choose a solver for an optimization problem
    3. Review and adjust the result

    Content preview

    Files

    • LICENSE1.1 KB
    • NOTICE-PALATEKIT.md0.5 KB
    • SKILL.md3.6 KB

    Origin and licence

    Listed unmodified

    Author
    parcadei
    Source
    github.com/parcadei/continuous-claude-v3/tree/d07ff4b06b62f43771bc0c927d0211b734d6149e/.claude/skills/math/optimization/convex-optimization
    Licence
    MIT

    Notice

    « convex-optimization » (parcadei, MIT) livré dans sa version d'origine : fiche en français et en anglais par PalateKit.

    User reviews

    –

    No ratings yet

    Loading reviews…

    Delete your review?

    Your rating and comment will be removed from the page.