Pith. sign in

REVIEW 3 major objections 49 references

GenHOI: Generalized Hand-Object Pose Estimation with Occlusion Awareness

T0 review · 3 major / 0 minor · reviewed 2026-07-13 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read GenHOI recovers 3D hand-object poses from a single RGB image under heavy occlusion by combining hierarchical text prompts, multi-modal masking, and hand priors.

desk verdict The GenHOI abstract is a standard CV method claim, but the supplied full text is a completely different paper (AC unit commitment), so nothing about GenHOI can be audited. read the letter →

arxiv 2603.19013 v4 pith:BQRA3N6X submitted 2026-03-19 cs.CV

Hui Yang , Wei Sun , Jian Liu , Jian Xiao , Tao Xie , Hossein Rahmani , Ajmal Saeed Mian , Nicu Sebe
show 1 more author
Gim Hee Lee
This is my paper
classification cs.CV
keywords hand-objectposeestimationocclusionawarenesshierarchicalsemanticpromptsmulti-modalmaskedmodelinghandpriorsgeneralizationDexYCBHO3Dv2
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Estimating the 3D pose of a hand interacting with an object from one ordinary photo is hard because objects look very different, grasps vary, and the hand or object is often heavily occluded. GenHOI claims that injecting hierarchical semantic knowledge written as text—describing object state, hand configuration, and interaction pattern—lets the model form abstract representations that still work for unseen objects and novel interactions, filling in what the pixels hide. It further trains by masking across RGB images, predicted point clouds, and those text descriptions so the network learns to reason about occlusion, while treating the hand’s known structure as a stable spatial reference that supplies interaction constraints. On the hard DexYCB and HO3Dv2 benchmarks the resulting system reports state-of-the-art accuracy. A reader who cares about robots, AR, or assistive systems therefore gains a practical route to reliable hand-object 3D understanding without needing multiple views or known object models.

What carries the argument

Hierarchical semantic prompt: a textual encoding of object state, hand configuration and interaction pattern that supplies high-level abstractions, compensating for missing visual evidence and enabling transfer to unseen objects and novel interactions; it is reinforced by multi-modal masking and hand-prior constraints.

What would settle it

Train GenHOI with and without the hierarchical prompts and multi-modal masking, then measure pose error on a held-out set of novel objects and interaction patterns under heavy occlusion; a large, statistically clear drop when either component is removed would falsify the central claim that those ingredients are what deliver the reported generalization.

Watch

Extended reading notes

Core claim

The paper establishes that a single framework, GenHOI, reaches state-of-the-art generalized 3D hand-object pose estimation from monocular RGB under heavy occlusion by fusing three ingredients: hierarchical semantic prompts that encode object states, hand configurations and interaction patterns in language; multi-modal masked modeling over RGB, predicted point clouds and text; and hand priors used as stable spatial anchors that extract implicit interaction constraints.

Load-bearing premise

The claim rests on the premise that hierarchical text prompts plus multi-modal masking over RGB, point clouds and text are enough to replace the missing visual cues and to generalize to objects and grasps never seen at training time.

Editorial extensions

If this is right

  • Monocular systems can produce usable 3D hand-object poses even when large parts of the hand or object are invisible.
  • New objects and grasp types can be handled without collecting large object-specific 3D training sets.
  • Hand kinematic priors become a practical regularizer that stabilizes pose recovery across shape and interaction variation.
  • Downstream tasks such as grasp planning or AR overlay gain more reliable 3D input from ordinary cameras.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same hierarchical-prompt-plus-masking pattern could be tried for other heavily occluded articulated interactions (e.g., tool use or two-hand manipulation).
  • If the text prompts are the main source of abstraction, performance should degrade predictably when the language descriptions are made deliberately incomplete or noisy.
  • Predicted point clouds act as an intermediate 3D scaffold; replacing them with denser depth or multi-view geometry might further reduce residual error under extreme occlusion.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 0 minor

Summary. The manuscript proposes PIOIA, a warm-startable progressive-integrality outer–inner approximation framework for the second-order-cone relaxation of AC network-constrained unit commitment (SOC-NCUC). It alternates between an MILP outer approximation that drops the nonlinear SOC and capacity constraints and replaces them with supporting hyperplanes (Bienstock–Villagra cuts) and a convex SOCP inner approximation obtained by fixing commitment variables. Progressive integrality proceeds through an LP stage, a partial-integrality generation stage that prioritizes generators by fractionalness scores, and a full-MILP stage; time-block Benders cuts derived from dual information of the inner SOCP further strengthen the outer model. Experiments on the Central Illinois 200-bus and South Carolina 500-bus systems (T=24) claim faster gap closure, better numerical robustness, and warm-start benefits relative to Gurobi, Mosek, and COPT.

Significance. If the claims hold, the work supplies a practical algorithmic compromise between DC-UC scalability and AC feasibility for day-ahead commitment. The progressive-integrality schedule and time-block Benders cuts are concrete engineering contributions that reduce early-iteration MILP cost while still producing dual bounds and feasible AC-consistent solutions. Warm-start reuse of cut pools is especially relevant for repeated or load-perturbed daily UC. The paper is explicit about formulation variants (with/without shedding and over-generation) and reports both relative gap and optimality gap, which is useful for industrial practice. Code is promised after publication.

major comments (3)
  1. The supplied manuscript title, abstract, and body describe an AC unit-commitment outer–inner approximation (arXiv:2603.19012, math.OC). The review request and abstract header refer to GenHOI (hand–object pose estimation, cs.CV, arXiv:2603.19013). No GenHOI method, hierarchical semantic prompt, multi-modal masking, or DexYCB/HO3Dv2 experiment appears. The central claim of the requested paper therefore cannot be audited from the provided text; this identity mismatch is load-bearing for any evaluation of GenHOI.
  2. Section IV and Tables II–VII: Gurobi is reported as the only commercial solver that reaches the target gap on the 200-bus instance, yet its solution exhibits a maximum violation of 1.34e-5 (Table II). The paper does not quantify how often the recovered commitment remains AC-feasible after a nonconvex AC power-flow check, nor does it report post-processing redispatch cost. Without that verification, the claim that SOC-NCUC commitments are “more consistent with physical network constraints” remains incompletely supported.
  3. Algorithm 1 and Section III-B: dynamic MIP gap and time-limit schedules (δ_mip reduced by 0.9, t_solver increased by 1.1) are presented as essential for efficiency, but no ablation isolates their contribution from progressive integrality or Benders cuts. Table III compares method variants, yet the dynamic-gap schedule is active in all of them; its necessity for the claimed speed-ups is therefore unestablished.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; the provided manuscript is a self-contained algorithmic optimization framework with externally validated cuts and independent benchmarks.

full rationale

The full manuscript text (despite title/abstract mismatch with GenHOI) presents PIOIA for SOC-NCUC: outer MILP approximations via linear cuts (5)-(6) from external Bienstock-Villagra [27], inner convex SOCPs with fixed binaries, progressive integrality stages (LP then partial then full), and time-block Benders cuts from duals of the inner problem. Validity of cuts and LBs is argued via standard set inclusion (F(M)subseteq continuous relaxation; Remarks 1-2). Self-citations to under-review [28],[29] (same lead author) only note the OA idea origin; the progressive strategy, dynamic MIP gaps/time limits, time-block Benders, warm-start, and experiments on 200/500-bus systems vs Gurobi/Mosek/COPT are independent and non-circular. No self-definitional equations, no fitted parameters renamed as predictions, no uniqueness theorems, no ansatz smuggling, and no renaming of known results as novel derivation. Empirical claims rest on external test systems and commercial solvers. (GenHOI abstract alone is also non-circular empirical SOTA, but unauditable here due to text mismatch.)

Assumptions & free parameters 0 free parameters · 4 assumptions · 2 invented entities

Abstract-only. Load-bearing premises are domain assumptions of single-view HOI learning and the unproven transfer power of hierarchical text prompts plus multi-modal masking. No free parameters or invented physical entities are specified in the abstract; model hyperparameters and prompt templates would be free parameters if the full paper were available.

assumptions (4)
  • ad hoc to paper Hierarchical textual descriptions of object state, hand configuration, and interaction pattern provide abstract representations that generalize to unseen objects and novel interactions under occlusion.
    Central design claim of GenHOI; asserted in the abstract without accessible proof or ablation.
  • ad hoc to paper Multi-modal masked modeling over RGB, predicted point clouds, and text enables robust occlusion reasoning for pose estimation.
    Methodological premise stated in the abstract; effectiveness is empirical and not checkable here.
  • domain assumption Hand priors supply stable spatial references that yield implicit interaction constraints sufficient for reliable object pose under shape and interaction variation.
    Common in HOI literature; used here as a load-bearing modeling choice.
  • domain assumption DexYCB and HO3Dv2 are adequate benchmarks for claiming generalized, occlusion-aware SOTA hand-object pose estimation.
    Standard evaluation assumption in the subfield; abstract relies on them for the SOTA claim.
invented entities (2)
  • hierarchical semantic prompt (GenHOI)
    purpose: Encode object states, hand configurations, and interaction patterns as text to drive generalization and fill missing visual cues.
    Named core component of the proposed framework; no independent evidence outside the claimed experiments.
  • multi-modal masked modeling strategy (RGB + point cloud + text)
    purpose: Train occlusion-aware reasoning by reconstructing across modalities.
    Proposed training mechanism; independent validation not available from abstract alone.

how reviews work

0 comments
Cite this review

Pith. "Pith review of GenHOI: Generalized Hand-Object Pose Estimation with Occlusion Awareness." pith.science (2026). https://pith.science/paper/BQRA3N6X

@misc{pith2026260319013,
  author       = {Pith},
  title        = {Pith review of: GenHOI: Generalized Hand-Object Pose Estimation with Occlusion Awareness},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/BQRA3N6X}},
  note         = {Machine review of arXiv:2603.19013}
}
read the original abstract

Generalized 3D hand-object pose estimation from a single RGB image remains challenging due to the large variations in object appearances and interaction patterns, especially under heavy occlusion. We propose GenHOI, a framework for generalized hand-object pose estimation with occlusion awareness. GenHOI integrates hierarchical semantic knowledge with hand priors to enhance model generalization under challenging occlusion conditions. Specifically, we introduce a hierarchical semantic prompt that encodes object states, hand configurations, and interaction patterns via textual descriptions. This enables the model to learn abstract high-level representations of hand-object interactions for generalization to unseen objects and novel interactions while compensating for missing or ambiguous visual cues. To enable robust occlusion reasoning, we adopt a multi-modal masked modeling strategy over RGB images, predicted point clouds, and textual descriptions. Moreover, we leverage hand priors as stable spatial references to extract implicit interaction constraints. This allows reliable pose inference even under significant variations in object shapes and interaction patterns. Extensive experiments on the challenging DexYCB and HO3Dv2 benchmarks demonstrate that our method achieves state-of-the-art performance in hand-object pose estimation.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

49 extracted references

  1. [1]

    A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem,

    M. Carri ´on and J. M. Arroyo, “A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem,”IEEE Transactions on power systems, vol. 21, no. 3, pp. 1371–1378, 2006

    2006

  2. [2]

    A. J. Conejo and L. Baringo,Power system operations. Springer, 2018, vol. 11

    2018

  3. [3]

    A. J. Wood, B. F. Wollenberg, and G. B. Shebl ´e,Power generation, operation, and control. John wiley & sons, 2013

    2013

  4. [4]

    A decomposition method for network-constrained unit commitment with ac power flow constraints,

    Y . Bai, H. Zhong, Q. Xia, C. Kang, and L. Xie, “A decomposition method for network-constrained unit commitment with ac power flow constraints,”Energy, vol. 88, pp. 595–603, 2015

    2015

  5. [5]

    A survey of relaxations and approximations of the power flow equations,

    D. K. Molzahn, I. A. Hiskenset al., “A survey of relaxations and approximations of the power flow equations,”Foundations and Trends® in Electric Energy Systems, vol. 4, no. 1-2, pp. 1–221, 2019

    2019

  6. [6]

    Solving unit commitment problems with general ramp constraints,

    A. Frangioni, C. Gentile, and F. Lacalandra, “Solving unit commitment problems with general ramp constraints,”International Journal of Elec- trical Power & Energy Systems, vol. 30, no. 5, pp. 316–326, 2008

    2008

  7. [7]

    Zero duality gap in optimal power flow problem,

    J. Lavaei and S. H. Low, “Zero duality gap in optimal power flow problem,”IEEE Transactions on Power systems, vol. 27, no. 1, pp. 92– 107, 2011

    2011

  8. [8]

    Radial distribution load flow using conic programming,

    R. A. Jabr, “Radial distribution load flow using conic programming,” IEEE Transactions on Power Systems, vol. 21, no. 3, pp. 1458–1459, 2006

    2006

Show all 49 references
  1. [9]

    Algorithms and software for convex mixed integer nonlinear programs,

    P. Bonami, M. Kilinc ¸, and J. Linderoth, “Algorithms and software for convex mixed integer nonlinear programs,” inMixed integer nonlinear programming. Springer, 2011, pp. 1–39

    2011

  2. [10]

    A framework for solving mixed- integer semidefinite programs,

    T. Gally, M. E. Pfetsch, and S. Ulbrich, “A framework for solving mixed- integer semidefinite programs,”Optimization Methods and Software, vol. 33, no. 3, pp. 594–632, 2018

    2018

  3. [11]

    An application of lagrangian relax- ation to scheduling in power-generation systems,

    J. A. Muckstadt and S. A. Koenig, “An application of lagrangian relax- ation to scheduling in power-generation systems,”Operations research, vol. 25, no. 3, pp. 387–403, 1977

    1977

  4. [12]

    Towards a more rigorous and practical unit commitment by lagrangian relaxation,

    F. Zhuang and F. D. Galiana, “Towards a more rigorous and practical unit commitment by lagrangian relaxation,”IEEE Transactions on Power Systems, vol. 3, no. 2, pp. 763–773, 2002

    2002

  5. [13]

    Network- constrained ac unit commitment under uncertainty: A benders’ decom- position approach,

    A. Nasri, S. J. Kazempour, A. J. Conejo, and M. Ghandhari, “Network- constrained ac unit commitment under uncertainty: A benders’ decom- position approach,”IEEE transactions on power systems, vol. 31, no. 1, pp. 412–422, 2015

    2015

  6. [14]

    Security-constrained unit commitment: A decomposition approach embodying kron reduction,

    G. E. Constante-Flores and A. J. Conejo, “Security-constrained unit commitment: A decomposition approach embodying kron reduction,” European Journal of Operational Research, vol. 319, no. 2, pp. 427– 441, 2024

    2024

  7. [15]

    Outer-approximation method for security constrained unit commitment,

    J. P. Ruiz, J. Wang, C. Liu, and G. Sun, “Outer-approximation method for security constrained unit commitment,”IET Generation, Transmis- sion & Distribution, vol. 7, no. 11, pp. 1210–1218, 2013

    2013

  8. [16]

    The unit commitment problem with ac optimal power flow constraints,

    A. Castillo, C. Laird, C. A. Silva-Monroy, J.-P. Watson, and R. P. O’Neill, “The unit commitment problem with ac optimal power flow constraints,”IEEE Transactions on Power Systems, vol. 31, no. 6, pp. 4853–4866, 2016

    2016

  9. [17]

    Global solution strategies for the network-constrained unit commitment problem with ac transmission constraints,

    J. Liu, C. D. Laird, J. K. Scott, J.-P. Watson, and A. Castillo, “Global solution strategies for the network-constrained unit commitment problem with ac transmission constraints,”IEEE Transactions on Power Systems, vol. 34, no. 2, pp. 1139–1150, 2018

    2018

  10. [18]

    Outer approximation and outer-inner approximation approaches for unit commitment problem,

    D. Han, J. Jian, and L. Yang, “Outer approximation and outer-inner approximation approaches for unit commitment problem,”IEEE Trans- actions on Power Systems, vol. 29, no. 2, pp. 505–513, 2013

    2013

  11. [19]

    Tight mixed integer linear programming formulations for the unit commitment problem,

    J. Ostrowski, M. F. Anjos, and A. Vannelli, “Tight mixed integer linear programming formulations for the unit commitment problem,”IEEE transactions on power systems, vol. 27, no. 1, pp. 39–46, 2011

    2011

  12. [20]

    On mixed-integer pro- gramming formulations for the unit commitment problem,

    B. Knueven, J. Ostrowski, and J.-P. Watson, “On mixed-integer pro- gramming formulations for the unit commitment problem,”INFORMS Journal on Computing, vol. 32, no. 4, pp. 857–876, 2020

    2020

  13. [21]

    Managing power balance and reserve fea- sibility in the ac unit commitment problem,

    R. Parker and C. Coffrin, “Managing power balance and reserve fea- sibility in the ac unit commitment problem,”Electric Power Systems Research, vol. 234, p. 110670, 2024

    2024

  14. [22]

    Strong socp relaxations for the optimal power flow problem,

    B. Kocuk, S. S. Dey, and X. A. Sun, “Strong socp relaxations for the optimal power flow problem,”Operations Research, vol. 64, no. 6, pp. 1177–1196, 2016

    2016

  15. [23]

    Strengthening convex relaxations with bound tightening for power network optimization,

    C. Coffrin, H. L. Hijazi, and P. Van Hentenryck, “Strengthening convex relaxations with bound tightening for power network optimization,” inInternational conference on principles and practice of constraint programming. Springer, 2015, pp. 39–57

    2015

  16. [24]

    Ac network- constrained unit commitment via relaxation and decomposition,

    G. E. Constante-Flores, A. J. Conejo, and F. Qiu, “Ac network- constrained unit commitment via relaxation and decomposition,”IEEE Transactions on Power Systems, vol. 37, no. 3, pp. 2187–2196, 2022

    2022

  17. [25]

    An misocp-based decomposition approach for the unit commitment problem with ac power flows,

    D. Tuncer and B. Kocuk, “An misocp-based decomposition approach for the unit commitment problem with ac power flows,”IEEE Transactions on Power Systems, vol. 38, no. 4, pp. 3388–3400, 2023

    2023

  18. [26]

    Strengthening the sdp relaxation of ac power flows with convex envelopes, bound tightening, and valid inequalities,

    C. Coffrin, H. L. Hijazi, and P. Van Hentenryck, “Strengthening the sdp relaxation of ac power flows with convex envelopes, bound tightening, and valid inequalities,”IEEE Transactions on Power Systems, vol. 32, no. 5, pp. 3549–3558, 2016

    2016

  19. [27]

    Accurate linear cutting-plane relaxations for acopf: D. bienstock, m. villagra,

    D. Bienstock and M. Villagra, “Accurate linear cutting-plane relaxations for acopf: D. bienstock, m. villagra,”Mathematical Programming Com- putation, pp. 1–55, 2025

    2025

  20. [28]

    Scheduling electricity production units to mitigate severe weather impact: An efficient computational implementation,

    Y . Dai, A. J. Conjeo, and F. Qiu, “Scheduling electricity production units to mitigate severe weather impact: An efficient computational implementation,” 2025, under review

    2025

  21. [29]

    Solving the conic formulation of the security- constrained unit commitment problem via decomposition,

    Y . Dai and A. J. Conjeo, “Solving the conic formulation of the security- constrained unit commitment problem via decomposition,” 2026, under review

    2026

  22. [30]

    New formulation and strong misocp relaxations for ac optimal transmission switching problem,

    B. Kocuk, S. S. Dey, and X. A. Sun, “New formulation and strong misocp relaxations for ac optimal transmission switching problem,” IEEE Transactions on Power Systems, vol. 32, no. 6, pp. 4161–4170, 2017

    2017

  23. [31]

    N. J. Higham,Accuracy and Stability of Numerical Algorithms, 2nd ed. Society for Industrial and Applied Mathematics, 2002

    2002

  24. [32]

    Identification, assessment, and correction of ill-conditioning and numerical instability in linear and integer programs,

    E. Klotz, “Identification, assessment, and correction of ill-conditioning and numerical instability in linear and integer programs,” inBridging data and decisions. INFORMS, 2014, pp. 54–108

    2014

  25. [33]

    An lp/nlp based branch and bound algorithm for convex minlp optimization problems,

    I. Quesada and I. E. Grossmann, “An lp/nlp based branch and bound algorithm for convex minlp optimization problems,”Computers & chemical engineering, vol. 16, no. 10-11, pp. 937–947, 1992

    1992

  26. [34]

    An algorithmic framework for convex mixed integer nonlinear programs,

    P. Bonami, L. T. Biegler, A. R. Conn, G. Cornu ´ejols, I. E. Grossmann, C. D. Laird, J. Lee, A. Lodi, F. Margot, N. Sawayaet al., “An algorithmic framework for convex mixed integer nonlinear programs,”Discrete optimization, vol. 5, no. 2, pp. 186–204, 2008

    2008

  27. [35]

    A review and comparison of solvers for convex minlp,

    J. Kronqvist, D. E. Bernal, A. Lundell, and I. E. Grossmann, “A review and comparison of solvers for convex minlp,”Optimization and Engineering, vol. 20, no. 2, pp. 397–455, 2019

    2019

  28. [36]

    Global optimization of mixed-integer nonlinear pro- grams with scip 8,

    K. Bestuzheva, A. Chmiela, B. M ¨uller, F. Serrano, S. Vigerske, and F. Wegscheider, “Global optimization of mixed-integer nonlinear pro- grams with scip 8,”Journal of Global Optimization, pp. 287–310, 2025

    2025

  29. [37]

    Partitioning procedures for solving mixed-variables pro- gramming problems,

    J. Benders, “Partitioning procedures for solving mixed-variables pro- gramming problems,”Numer. math, vol. 4, no. 1, pp. 238–252, 1962

    1962

  30. [38]

    Shapiro, D

    A. Shapiro, D. Dentcheva, and A. Ruszczynski,Lectures on stochastic programming: modeling and theory. SIAM, 2021. 11

    2021

  31. [39]

    An outer-approximation algorithm for a class of mixed-integer nonlinear programs,

    M. A. Duran and I. E. Grossmann, “An outer-approximation algorithm for a class of mixed-integer nonlinear programs,”Mathematical pro- gramming, vol. 36, no. 3, pp. 307–339, 1986

    1986

  32. [40]

    Solving mixed integer nonlinear programs by outer approximation,

    R. Fletcher and S. Leyffer, “Solving mixed integer nonlinear programs by outer approximation,”Mathematical programming, vol. 66, no. 1, pp. 327–349, 1994

    1994

  33. [41]

    Grid structural characteristics as validation criteria for synthetic networks,

    A. B. Birchfield, T. Xu, K. M. Gegner, K. S. Shetye, and T. J. Over- bye, “Grid structural characteristics as validation criteria for synthetic networks,”IEEE Transactions on Power Systems, vol. 32, no. 4, pp. 3258–3265, 2017

    2017

  34. [42]

    Scheduling of power units via relaxation and decom- position,

    G. E. C. Flores, “Scheduling of power units via relaxation and decom- position,” Ph.D. dissertation, The Ohio State University, 2022

    2022

  35. [43]

    Julia: A fresh approach to numerical computing,

    J. Bezanson, A. Edelman, S. Karpinski, and V . B. Shah, “Julia: A fresh approach to numerical computing,”SIAM review, vol. 59, no. 1, pp. 65–98, 2017

    2017

  36. [44]

    Jump 1.0: recent improvements to a modeling language for mathematical optimization,

    M. Lubin, O. Dowson, J. D. Garcia, J. Huchette, B. Legat, and J. P. Vielma, “Jump 1.0: recent improvements to a modeling language for mathematical optimization,”Mathematical Programming Computation, vol. 15, pp. 581–589, 2023

    2023

  37. [45]

    Gurobi Optimizer Reference Manual,

    Gurobi Optimization, LLC, “Gurobi Optimizer Reference Manual,”

  38. [46]

    Available: https://www.gurobi.com

    [Online]. Available: https://www.gurobi.com

  39. [47]

    ApS,The MOSEK Python Fusion API manual

    M. ApS,The MOSEK Python Fusion API manual. Version 11.0.,

  40. [48]

    Available: https://docs.mosek.com/latest/pythonfusion/ index.html

    [Online]. Available: https://docs.mosek.com/latest/pythonfusion/ index.html

  41. [49]

    Cardinal Optimizer (COPT) user guide,

    D. Ge, Q. Huangfu, Z. Wang, J. Wu, and Y . Ye, “Cardinal Optimizer (COPT) user guide,” https://guide.coap.online/copt/en-doc, 2022

    2022

Pith tools

Reviewed July 13, 2026 · model on record in the stance chip above.