# 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. 100 results; page 3/4. ## 第 11951 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0076`; number: 11951 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0076/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0076/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0076.json) ## 第 11952 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0077`; number: 11952 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0077/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0077/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0077.json) ## 第 11953 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0078`; number: 11953 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0078/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0078/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0078.json) ## 第 11954 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0079`; number: 11954 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0079/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0079/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0079.json) ## 第 11955 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0080`; number: 11955 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0080/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0080/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0080.json) ## 第 11956 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0081`; number: 11956 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0081/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0081/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0081.json) ## 第 11957 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0082`; number: 11957 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0082/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0082/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0082.json) ## 第 11958 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0083`; number: 11958 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0083/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0083/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0083.json) ## 第 11959 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0084`; number: 11959 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0084/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0084/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0084.json) ## 第 11960 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0085`; number: 11960 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0085/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0085/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0085.json) ## 第 11961 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0086`; number: 11961 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0086/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0086/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0086.json) ## 第 11962 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0087`; number: 11962 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0087/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0087/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0087.json) ## 第 11963 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0088`; number: 11963 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0088/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0088/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0088.json) ## 第 11964 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0089`; number: 11964 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0089/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0089/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0089.json) ## 第 11965 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0090`; number: 11965 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0090/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0090/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0090.json) ## 第 11966 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0091`; number: 11966 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0091/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0091/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0091.json) ## 第 11967 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0092`; number: 11967 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0092/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0092/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0092.json) ## 第 11968 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0093`; number: 11968 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0093/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0093/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0093.json) ## 第 11969 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0094`; number: 11969 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0094/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0094/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0094.json) ## 第 11970 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0095`; number: 11970 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0095/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0095/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0095.json) ## 第 11971 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0096`; number: 11971 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0096/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0096/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0096.json) ## 第 11972 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0097`; number: 11972 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0097/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0097/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0097.json) ## 第 11973 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0098`; number: 11973 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0098/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0098/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0098.json) ## 第 11974 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0099`; number: 11974 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0099/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0099/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0099.json) ## 第 11975 題：凸最佳化問題 - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0100`; number: 11975 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/zh-Hant/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/zh-Hant/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - 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-0100/) / [Markdown](/zh-Hant/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0100/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0100.json) [Next](/zh-Hant/explore/index.md?mko=mko-convex-optimization-problem&page=4)