# OCME ยท Knowledge & practice explorer 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. ## Question 11951: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0076`; number: 11951 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0076/) / [Markdown](/en/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) ## Question 11952: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0077`; number: 11952 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0077/) / [Markdown](/en/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) ## Question 11953: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0078`; number: 11953 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0078/) / [Markdown](/en/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) ## Question 11954: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0079`; number: 11954 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0079/) / [Markdown](/en/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) ## Question 11955: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0080`; number: 11955 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0080/) / [Markdown](/en/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) ## Question 11956: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0081`; number: 11956 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0081/) / [Markdown](/en/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) ## Question 11957: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0082`; number: 11957 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0082/) / [Markdown](/en/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) ## Question 11958: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0083`; number: 11958 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0083/) / [Markdown](/en/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) ## Question 11959: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0084`; number: 11959 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0084/) / [Markdown](/en/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) ## Question 11960: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0085`; number: 11960 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0085/) / [Markdown](/en/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) ## Question 11961: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0086`; number: 11961 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0086/) / [Markdown](/en/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) ## Question 11962: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0087`; number: 11962 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0087/) / [Markdown](/en/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) ## Question 11963: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0088`; number: 11963 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0088/) / [Markdown](/en/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) ## Question 11964: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0089`; number: 11964 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0089/) / [Markdown](/en/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) ## Question 11965: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0090`; number: 11965 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0090/) / [Markdown](/en/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) ## Question 11966: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0091`; number: 11966 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0091/) / [Markdown](/en/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) ## Question 11967: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0092`; number: 11967 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0092/) / [Markdown](/en/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) ## Question 11968: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0093`; number: 11968 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0093/) / [Markdown](/en/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) ## Question 11969: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0094`; number: 11969 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0094/) / [Markdown](/en/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) ## Question 11970: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0095`; number: 11970 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0095/) / [Markdown](/en/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) ## Question 11971: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0096`; number: 11971 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0096/) / [Markdown](/en/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) ## Question 11972: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0097`; number: 11972 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0097/) / [Markdown](/en/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) ## Question 11973: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0098`; number: 11973 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0098/) / [Markdown](/en/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) ## Question 11974: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0099`; number: 11974 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0099/) / [Markdown](/en/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) ## Question 11975: Compare Only Two Eligible Candidates, Not the Whole Problem - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0100`; number: 11975 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-pairwise-feasible-comparison](/en/explore/?family=qf-mod25-convexopt-pairwise-feasible-comparison) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0100/) / [Markdown](/en/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)