{"paper_id":"2509.21929","title":"Optimal Consumption-Investment with Epstein-Zin Utility under Leverage Constraint","authors":["Dejian Tian","Weidong Tian","Jianjun Zhou","Zimu Zhu"],"paper_date":"2025-09-26","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2509.21929v2","page_url":"https://thequant.space/flowcharts/optimal-consumption-investment-with-epstein-zin-utility-unde/","scores":{"empirical_rigor":1,"math_complexity":9.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes a theoretical framework for optimal portfolio choice with Epstein‑Zin recursive utility under a general leverage constraint, including a new dynamic programming principle and a characterization of the unique viscosity solution to the associated HJB equation.","quote":"We study optimal portfolio choice under Epstein-Zin recursive utility in the presence of general leverage constraints. We first establish that the optimal value function is the unique viscosity solution to the associated Hamilton-Jacobi-Bellman (HJB) equation, by developing a new dynamic programming principle under constraints.","summary":"We study optimal portfolio choice under Epstein-Zin recursive utility in the presence of general leverage constraints. We first establish that the optimal value function is the unique viscosity solution to the associated Hamilton-Jacobi-Bellman (HJB) equation, by developing a new dynamic…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Relative risk aversion R satisfies 0 < R < 1 throughout the analysis.","type":"model","stated":"explicit","quote":"(2.10) For technical reasons, we assume 0 < R < 1 throughout the paper, although we note that several results extend to the more general case.","support":"full"},{"assumption":"The leverage constraint is linear in wealth, g(x)=k x + L, with at least one of k or L positive.","type":"model","stated":"explicit","quote":"e following highly nonlinear ODE as follows: δνJ = −κ(Jx)2 Jxx + S 1 −S ((1 −R)J) ρ S (Jx)1−1 S + rxJx, x ∈U (3.4) and δνJ =(µ −r)g(x)Jx + 1 2σ2g(x)2Jxx + S 1 −S ((1 −R)J) ρ S (Jx)1−1 S (3.5) + rxJx, x ∈B. 6 We provide a detailed characterization of the solution under a linear leverage bound, specified as g(x) = kx + L, where at least one of k and L is positive.","support":"full"},{"assumption":"Consumption processes are truncated at any fixed positive level to establish the dynamic programming principle.","type":"model","stated":"explicit","quote":"By exploiting the relationship between the Epstein–Zin utility process and the infinite-horizon BSDE, we show that the optimal value function satisfies the DPP when the consumption process is truncated at any fixed positive level.","support":"full"},{"assumption":"The Epstein‑Zin aggregator is non‑Lipschitz in both consumption and continuation value components.","type":"model","stated":"explicit","quote":"The challenge in proving the dynamic program principle is the non-Lipschitz feature of the Epstein-Zin aggregator on both components.","support":"full"},{"assumption":"The market follows a continuous‑time Black‑Scholes setting with constant drift µ, risk‑free rate r, and volatility σ.","type":"market","stated":"implied","quote":"Theorem 8.1 in Herdegen, Hobson and Jerome (2023b) establishes that the optimal strategies are given by: πez = µ −r Rσ2 X and cez = ηX, (2.7) and the optimal value function in this situation is Jez(x) = η−νS x1−R 1 −R, (2.8) under assumption that η ≡1 S h δ + (S −1)(r + κ R) i > 0, (2.9) 5 where κ = (µ −r)2 2σ2 .","support":"full"},{"assumption":"The feasible strategy set without borrowing constraints is denoted A^{ez}(x).","type":"model","stated":"explicit","quote":"The corresponding optimal portfolio choice problem is as follows: Jez(x) = sup (π,c)∈Aez(x) V c 0 , x > 0, (2.6) where Aez(x) corresponds to the feasible strategies set without borrowing constraints.","support":"full"}]},"datasets":{"status":"none_found","items":[],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"none"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"none","findings":[{"finding":"The optimal value function is the unique viscosity solution of the HJB equation under the leverage constraint.","kind":"theoretical","quote":"We first establish that the optimal value function is the unique viscosity solution to the associated Hamilton-Jacobi-Bellman (HJB) equation, by developing a new dynamic programming principle under constraints. In the first main result, Theorem 3.1, we establish that the optimal value function is the unique viscosity solution of the corresponding HJB equation under appropriate boundary conditions.","support":"full"},{"finding":"The value function is C²‑smooth, allowing explicit characterization of optimal consumption and investment strategies.","kind":"theoretical","quote":"We further demonstrate that the value function admits smoothness and characterize the optimal consumption and investment strategies. The optimal value function J is the C2(R++) solution of the equation (3.1).","support":"full"},{"finding":"Explicit analytical solutions are obtained for two special linear leverage cases: proportional leverage (constrained region (0,∞)) and constant leverage (constrained region (x*,∞) with smooth‑fit condition).","kind":"theoretical","quote":"First, when the linear function reduces to a proportion of wealth, the constrained region is (0, ∞), and the optimal investment strategy follows the prescribed proportional leverage constraint. Second, when the linear function reduces to a positive constant, the constrained region is (x∗, ∞), where x∗> 0 is uniquely determined by a smooth-fit condition at this threshold.","support":"full"},{"finding":"Comparative analysis highlights differences from classical time‑separable preferences and from the unconstrained Epstein‑Zin case.","kind":"theoretical","quote":"Finally, we conduct a comparative analysis, highlighting the differences relative to the classical time-separable preferences and to the setting without leverage constraints. In general, we also present several comparative analyses of the optimal consumption and investment strategies.","support":"full"},{"finding":"The new dynamic programming principle is established for Epstein‑Zin utility with non‑Lipschitz aggregator, enabling the viscosity‑solution proof.","kind":"theoretical","quote":"4 Dynamic programming principle The goal of this section is to prove a new type of dynamic program principle for Epstein-Zin utility, which is essential to show Theorem 3.1 in the next section. The challenge in proving the dynamic program principle is the non-Lipschitz feature of the Epstein-Zin aggregator on both components.","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":20,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T19:47:31Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}