# OCME · 知識與練習查找

302 MKO / 1,441 families / 360 batches / 36,000 questions.

36,000 second-context math/bilingual reviewed; 0 display/symbol-checked candidates. Source questions: candidate. English: ai_candidate. No new proof, Lean, SREG or training.

1 results; page 1/1.

## 第 11906 題：凸最佳化問題

- ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0031`; number: 11906
- Processing: second_context_reviewed
- MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/)
- Family: [qf-mod25-convexopt-feasible-point-audit](/zh-Hant/explore/?family=qf-mod25-convexopt-feasible-point-audit)
- Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/zh-Hant/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations)
- [Derivation](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0031/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0031/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0031.json)