constrained-optimization
Problem-solving strategies for constrained optimization in optimization
Install / Use
npx skills add parcadei/Continuous-Claude-v3 --skill constrained-optimizationInstalls into whichever agent you are using.
SKILL.md
Installable skill definition
Quality Score
Category
Development & EngineeringSupported Platforms
Tags
Our assessment of constrained-optimization
constrained-optimization scores 82/100 on our quality scale, 3340th of 4,698 Development & Engineering skills we index.
Its SKILL.md is 3.6 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.
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 foundOur 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.
constrained-optimization compared with similar skills
All 4 of these similar skills score higher than constrained-optimization; compare them before choosing.
| Skill | Score | Stars | Updated | Format |
|---|---|---|---|---|
| constrained-optimization (this skill)by parcadei | 82 | 3.9k | 10mo ago | SKILL.md |
| taste-skillby Leonxlnx | 100 | 116.8k | 8d ago | CLAUDE.md |
| ai-job-searchby ai-job-search-dev | 100 | 72.1k | today | CLAUDE.md |
| claude-howtoby luongnv89 | 100 | 47.3k | 2d ago | CLAUDE.md |
| lobehubby lobehub | 100 | 85.6k | today | MCP Server |
Frequently asked questions
- How do I install constrained-optimization?
- Run
npx skills add parcadei/Continuous-Claude-v3 --skill constrained-optimization. The install tabs above show the steps for each supported agent. - Which AI agents does constrained-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 constrained-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 constrained-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.
Skill content
View source on GitHubname: constrained-optimization description: "Problem-solving strategies for constrained optimization in optimization" allowed-tools: [Bash, Read]
Constrained Optimization
When to Use
Use this skill when working on constrained-optimization problems in optimization.
Decision Tree
-
Constraint Classification
- Equality: h(x) = 0
- Inequality: g(x) <= 0
- Bounds: l <= x <= u
-
Lagrangian Method (Equality Constraints)
- L(x, lambda) = f(x) + sum lambda_j * h_j(x)
- Solve: grad_x L = 0 and h(x) = 0
sympy_compute.py solve "grad_L_system"
-
KKT Conditions (Inequality Constraints)
- Extend Lagrangian with mu_i for g_i(x) <= 0
- Complementary slackness: mu_i * g_i(x) = 0
z3_solve.py prove "kkt_satisfied"
-
Penalty and Barrier Methods
- Penalty: add P(x) = rho * sum max(0, g_i(x))^2
- Barrier: add B(x) = -sum log(-g_i(x)) for interior point
- Increase penalty/decrease barrier parameter iteratively
-
SciPy Constrained Optimization
scipy.optimize.minimize(f, x0, method='SLSQP', constraints=cons)- constraints = [{'type': 'eq', 'fun': h}, {'type': 'ineq', 'fun': lambda x: -g(x)}]
- bounds = [(l1, u1), (l2, u2), ...]
Tool Commands
Scipy_Slsqp
uv run python -c "from scipy.optimize import minimize; cons = dict(type='eq', fun=lambda x: x[0] + x[1] - 1); res = minimize(lambda x: x[0]**2 + x[1]**2, [1, 1], method='SLSQP', constraints=cons); print('Min at', res.x)"
Sympy_Lagrangian
uv run python -m runtime.harness scripts/sympy_compute.py solve "[2*x - lam, 2*y - lam, x + y - 1]" --vars "[x, y, lam]"
Z3_Kkt_Satisfied
uv run python -m runtime.harness scripts/z3_solve.py prove "complementary_slackness"
Key Techniques
From indexed textbooks:
- [nonlinear programming_tif] Conjugate Direction Methods** - Methods involving directions conjugate to each other with respect to a certain quadratic form, enhancing efficiency in finding minima. Quasi-Newton Methods** - Variants of Newton’s method that approximate the Hessian matrix. Nonderivative Methods** - Address optimization methods that don’t require derivative information.
- [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.
- [nonlinear programming_tif] In this chapter we consider the constrained optimization problem minimize f(z) subject to z € X, where we assume throughout that: (a) X is a nonempty and convex subset of 2. When dealing with algo- rithms, we assume in addition that X is closed. The function f: %™ — R is continuously differentiable over X.
- [nonlinear programming_tif] The methods for obtaining lower bounds are elaborated on in Section 5. Lagrangian relaxation method is discussed in detail. This method requires the optimization of nondifferentiable functions, and some of the major relevant algorithms, subgradient and cutting plane methods, will be discussed in Chapter 6.
- [nonlinear programming_tif] The image depicts a three-dimensional graphical representation, likely related to linear algebra or optimization. Key elements include: - Axes: Three intersecting axes are shown, suggesting a three-dimensional coordinate system. Equation and Constraints**: A linear equation
{x | Ax = b, x ≥ 0}is noted, indicating a system or set of constraints.
Cognitive Tools Reference
See .claude/skills/math-mode/SKILL.md for full tool documentation.
Related Skills
taste-skill
116.8kAgent skills that give coding agents taste: art direction, reference images and a browser check instead of generic AI pages
ai-job-search
72.1kThe job search that runs on your machine. AI job application framework built on Claude Code: evaluate postings, tailor CVs, write cover letters, prep interviews. Fork it and own it.
claude-howto
47.3kA visual, example-driven guide to Claude Code — from basic concepts to advanced agents, with copy-paste templates that bring immediate value.
lobehub
85.6k🤯 LobeHub - Super-Agents on Your Team. Add super-agents to the chats your team already uses.They take on work by themselves and get better every week.
Languages
Trust signals
From repository metadata: license, adoption, age and documentation. Not a code audit — see the Safety scan above for what the skill file itself contains.
