# 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. 25 results; page 1/1. ## 第 11926 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0051`; number: 11926 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0051/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0051/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0051.json) ## 第 11927 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0052`; number: 11927 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0052/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0052/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0052.json) ## 第 11928 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0053`; number: 11928 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0053/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0053/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0053.json) ## 第 11929 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0054`; number: 11929 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0054/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0054/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0054.json) ## 第 11930 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0055`; number: 11930 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0055/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0055/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0055.json) ## 第 11931 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0056`; number: 11931 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0056/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0056/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0056.json) ## 第 11932 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0057`; number: 11932 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0057/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0057/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0057.json) ## 第 11933 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0058`; number: 11933 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0058/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0058/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0058.json) ## 第 11934 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0059`; number: 11934 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0059/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0059/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0059.json) ## 第 11935 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0060`; number: 11935 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0060/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0060/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0060.json) ## 第 11936 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0061`; number: 11936 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0061/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0061/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0061.json) ## 第 11937 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0062`; number: 11937 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0062/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0062/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0062.json) ## 第 11938 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0063`; number: 11938 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0063/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0063/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0063.json) ## 第 11939 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0064`; number: 11939 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0064/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0064/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0064.json) ## 第 11940 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0065`; number: 11940 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0065/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0065/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0065.json) ## 第 11941 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0066`; number: 11941 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0066/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0066/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0066.json) ## 第 11942 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0067`; number: 11942 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0067/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0067/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0067.json) ## 第 11943 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0068`; number: 11943 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0068/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0068/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0068.json) ## 第 11944 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0069`; number: 11944 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0069/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0069/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0069.json) ## 第 11945 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0070`; number: 11945 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0070/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0070/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0070.json) ## 第 11946 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0071`; number: 11946 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0071/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0071/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0071.json) ## 第 11947 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0072`; number: 11947 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0072/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0072/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0072.json) ## 第 11948 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0073`; number: 11948 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0073/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0073/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0073.json) ## 第 11949 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0074`; number: 11949 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0074/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0074/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0074.json) ## 第 11950 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0075`; number: 11950 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/zh-Hant/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - 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-0075/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0075/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0075.json)