When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? | Paper Citation Record

Observation fe3aba2c-ef7e-441e-835d-58e0a7c0cbc4 · outbound

This paper cites An implementation of kar- markar’s algorithm for linear programming.Mathematical programming, 44:297–335, 1989.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? An implementation of kar- markar’s algorithm for linear programming.Mathematical programming, 44:297–335, 1989

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.925113Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 43f899cd-d633-4ba9-9fd6-eea7b4a10ba6 · outbound

This paper cites HEC/Université de Geneve, 1996.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? HEC/Université de Geneve, 1996

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.917371Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a1f93adb-7bbd-4119-9eb6-ae7ef4b7a088 · outbound

This paper cites Inexact interior-point method.Journal of Optimization Theory and Applications, 96:109– 121, 1998.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Inexact interior-point method.Journal of Optimization Theory and Applications, 96:109– 121, 1998

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.910602Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation e0f83c80-b52e-4f83-ae7c-90792a7f8d56 · outbound

This paper cites An inexact dual logarithmic barrier method for solving sparse semidefinite programs.Mathematical Programming, 178:109–143, 2019.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? An inexact dual logarithmic barrier method for solving sparse semidefinite programs.Mathematical Programming, 178:109–143, 2019

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.903691Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation dc6d9fc7-1971-4028-83ab-c5597bd2ab82 · outbound

This paper cites Algorithm 875: Dsdp5-software for semidefinite programming.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Algorithm 875: Dsdp5-software for semidefinite programming

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.896517Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 1c6d07e3-2c38-4db1-8f6c-cca3ec966e4e · outbound

This paper cites A new preconditioning approach for an interior point-proximal method of multipliers for linear and convex quadratic programming.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? A new preconditioning approach for an interior point-proximal method of multipliers for linear and convex quadratic programming

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.889488Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 37b78694-0d26-4bbb-90c8-cd3c463870d7 · outbound

This paper cites Inexact constraint preconditioners for linear systems arising in interior point methods.Computational Optimization and Applications, 36:137– 147, 2007.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Inexact constraint preconditioners for linear systems arising in interior point methods.Computational Optimization and Applications, 36:137– 147, 2007

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.882626Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 2654b162-906b-4396-88c7-0463054441f7 · outbound

This paper cites Preconditioning indefinite systems in interior point methods for optimization.Computational Optimization and Applications, 28:149–171, 2004.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Preconditioning indefinite systems in interior point methods for optimization.Computational Optimization and Applications, 28:149–171, 2004

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.874520Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation e1d169c3-0dcc-4bee-b6df-ac253d0d05b9 · outbound

This paper cites Faster randomized infeasible interior point methods for tall/wide linear programs.Advances in Neural Information Processing Systems, 33:8704– 8715, 2020.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Faster randomized infeasible interior point methods for tall/wide linear programs.Advances in Neural Information Processing Systems, 33:8704– 8715, 2020

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.866590Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 3a629b7e-5f84-4e07-b48a-da51b5e534e0 · outbound

This paper cites Randomized Nystr\"om Preconditioned Interior Point-Proximal Method of Multipliers.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Randomized Nystr\"om Preconditioned Interior Point-Proximal Method of Multipliers

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-12T13:44:09.472650Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 41b70074-1cab-43ad-a892-a5cf696e8b3a · outbound

This paper cites Proximal stabilized interior point methods and low-frequency-update preconditioning techniques.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Proximal stabilized interior point methods and low-frequency-update preconditioning techniques

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.859241Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation d59a5b40-5c31-4836-bc01-0c56119d40ac · outbound

This paper cites Solving linear programs in the current matrix multipli- cation time.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Solving linear programs in the current matrix multipli- cation time

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.852255Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation b21247e0-0eb6-4678-b750-1266ca11cad1 · outbound

This paper cites A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.845176Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation c510cc2f-2b2f-4f8c-aa6e-9d08209a7e9d · outbound

This paper cites Iterative solution of problems of linear and quadratic programming.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Iterative solution of problems of linear and quadratic programming

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.837018Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 689184f2-38fb-45c2-ab91-4cf3c1c90c5e · outbound

This paper cites Convergence of a class of inexact interior-point algorithms for linear programs.Mathematics of Operations Research, 24(1):50–71, 1999.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Convergence of a class of inexact interior-point algorithms for linear programs.Mathematics of Operations Research, 24(1):50–71, 1999

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.830184Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 9077fe7e-e21f-49d5-880f-a8c1c3704373 · outbound

This paper cites HDSDP: Software for Semidefinite Programming.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? HDSDP: Software for Semidefinite Programming

Reference 16

Resolution: verified exact; local_arxiv, observed 2026-08-12T13:44:09.589585Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation aa96c002-bd9e-4c79-83ea-1eb2f744e382 · outbound

This paper cites Christophel, Kati Jarck, Thorsten Koch, Jeff Linderoth, Marco Lübbecke, Hans D.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Christophel, Kati Jarck, Thorsten Koch, Jeff Linderoth, Marco Lübbecke, Hans D

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.822952Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 0210861a-fe0c-4d76-9337-12f7c28b82b4 · outbound

This paper cites Interior point methods 25 years later.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Interior point methods 25 years later

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.815887Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 91a72e06-3f06-4ca3-aace-40542713c09a · outbound

This paper cites Matrix-free interior point method.Computational Optimization and Applications, 51:457– 480, 2012.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Matrix-free interior point method.Computational Optimization and Applications, 51:457– 480, 2012

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.808884Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation da3a0a57-d444-4d7d-949d-9dbd1e39ef33 · outbound

This paper cites General-purpose preconditioning for regu- larized interior point methods.Computational Optimization and Applications, 83(3):727–757, 2022.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? General-purpose preconditioning for regu- larized interior point methods.Computational Optimization and Applications, 83(3):727–757, 2022

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.801668Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 7fa7e09a-95d8-4717-9267-7e7fc8295374 · outbound

This paper cites Properties of the central points in linear programming problems.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Properties of the central points in linear programming problems

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.794330Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation b2b624bd-4251-42f4-b20a-9376fee5b9ac · outbound

This paper cites Degeneracy in interior point methods for linear programming: a survey.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Degeneracy in interior point methods for linear programming: a survey

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.786860Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation f3ecd760-2bd3-4ae6-83cb-c600e010d919 · outbound

This paper cites Convergence behavior of interior-point algorithms.Mathematical Program- ming, 60(1-3):215–228, 1993.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Convergence behavior of interior-point algorithms.Mathematical Program- ming, 60(1-3):215–228, 1993

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.779357Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 43063b03-d5bb-404f-8e9e-a56bf2720b7b · outbound

This paper cites A new polynomial-time algorithm for linear programming.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? A new polynomial-time algorithm for linear programming

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.772084Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 54711825-c253-4a0d-8db9-f4b16327cbda · outbound

This paper cites Computational results of an interior point algorithm for large scale linear programming.Mathematical Programming, 52:555–586, 1991.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Computational results of an interior point algorithm for large scale linear programming.Mathematical Programming, 52:555–586, 1991

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.764158Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 15f96292-f4c4-43d3-9a7c-5aa4fcfdcd09 · outbound

This paper cites Path finding methods for linear programming: Solving linear programs in o (vrank) iterations and faster algorithms for maximum flow.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Path finding methods for linear programming: Solving linear programs in o (vrank) iterations and faster algorithms for maximum flow

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.756617Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 24d2d11e-6b05-4dff-a6c4-712ead434c25 · outbound

This paper cites Springer, 1984.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Springer, 1984

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-12T13:44:09.513311Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8692491b-91ba-4b95-818b-2f2f7e865c36 · outbound

This paper cites Interior point methods for linear programming: Computational state of the art.ORSA Journal on Computing, 6(1):1–14, 1994.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Interior point methods for linear programming: Computational state of the art.ORSA Journal on Computing, 6(1):1–14, 1994

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.745145Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 73e57aee-0b19-4388-bc7d-b45bdfead747 · outbound

This paper cites On the implementation of a primal-dual interior point method.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? On the implementation of a primal-dual interior point method

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.737728Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a0479cfe-370a-4a3b-bad9-94676abba561 · outbound

This paper cites An independent benchmarking of sdp and socp solvers.Mathematical Programming, 95(2):407–430, 2003.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? An independent benchmarking of sdp and socp solvers.Mathematical Programming, 95(2):407–430, 2003

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.729736Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 5cad91d8-85aa-4d6c-ad8e-6c6185753bc9 · outbound

This paper cites Benchmarking optimization software-a (hi) story.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Benchmarking optimization software-a (hi) story

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.722082Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation d3bf4c52-f4f6-4184-9d4a-c86bd9612999 · outbound

This paper cites Interior point methods for linear optimization.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Interior point methods for linear optimization

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.714724Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation ef459cf2-3e29-412d-b263-ecb039f69de7 · outbound

This paper cites Wiley Chichester, 1997.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Wiley Chichester, 1997

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.707488Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 8045205d-4bdd-4dc7-baf5-85cb4fcfa63f · outbound

This paper cites A polynomial method of approximate centers for linear programming.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? A polynomial method of approximate centers for linear programming

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.700231Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 42d8141b-526a-4020-a152-038bf86057aa · outbound

This paper cites SIAM, 2003.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? SIAM, 2003

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-12T13:44:09.532314Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5686bcae-bd4d-41c5-8537-a3b503fa316c · outbound

This paper cites Implementation of an interior point method with basis preconditioning.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Implementation of an interior point method with basis preconditioning

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.689159Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation e73084ce-1fc4-405f-8dcb-634535efab2c · outbound

This paper cites Scaling, shifting and weighting in interior-point methods.Computational Optimization and Applications, 3(4):305–315, 1994.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Scaling, shifting and weighting in interior-point methods.Computational Optimization and Applications, 3(4):305–315, 1994

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.682387Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation dd8c2f64-f9e9-4f9a-a2ef-653aed2a8aba · outbound

This paper cites A deterministic linear program solver in current matrix multiplication time.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? A deterministic linear program solver in current matrix multiplication time

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.675691Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 41aa6f59-924a-4384-acf2-5a5534e1ce60 · outbound

This paper cites A primal-dual interior point method whose running time depends only on the constraint matrix.Mathematical Programming, 74(1):79–120, 1996.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? A primal-dual interior point method whose running time depends only on the constraint matrix.Mathematical Programming, 74(1):79–120, 1996

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.668597Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 97855fc4-04f3-4d90-ae50-43418a059aa9 · outbound

This paper cites Anoteonhybridpreconditioners for large-scale normal equations arising from interior-point methods.Optimization Methods & Software, 25(2):321–332, 2010.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Anoteonhybridpreconditioners for large-scale normal equations arising from interior-point methods.Optimization Methods & Software, 25(2):321–332, 2010

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.661369Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 15166d5a-f01d-49cc-817a-2952f3270f69 · outbound

This paper cites Adaptive use of iterative methods in predictor–corrector interior point methods for linear programming.Numerical Algorithms, 25:387–406, 2000.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Adaptive use of iterative methods in predictor–corrector interior point methods for linear programming.Numerical Algorithms, 25:387–406, 2000

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.654211Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation bd7784c4-a1b3-4d3f-90dc-dcde101aaf72 · outbound

This paper cites SIAM, 1997.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? SIAM, 1997

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.646741Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 43b37a4c-07ad-40b9-a156-0d31f9bc4f75 · outbound

This paper cites Ano(n3l) potential reduction algorithm for linear programming.Mathematical programming, 50(1-3):239–258, 1991.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Ano(n3l) potential reduction algorithm for linear programming.Mathematical programming, 50(1-3):239–258, 1991

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.639611Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 91e04e51-bfce-4c9a-8e24-219c4b32d071 · outbound

This paper cites John Wiley & Sons, 2011.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? John Wiley & Sons, 2011

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.632101Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 69fbd8d7-8cf2-42d9-9ade-55f44467204d · outbound

This paper cites A new stopping criterion for krylov solvers applied in interior point methods.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? A new stopping criterion for krylov solvers applied in interior point methods

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.625201Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation c3745750-cb69-43ff-8bf9-9fe9158126f5 · outbound

This paper cites Next consider solving(A W2A⊤)−1A W(WX−1)v.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Next consider solving(A W2A⊤)−1A W(WX−1)v

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.618095Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation d90a54ae-a059-4ede-a8d7-e27c84855fb1 · outbound

This paper cites Lemma C.4.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Lemma C.4

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.610610Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation dd4ae6b4-8254-4979-8855-cc7a4f65af01 · outbound

This paper cites Therefore x+ ∈ F0 p.

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization? Therefore x+ ∈ F0 p

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:44:09.603491Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Coverage vector

Reference resolution

Outbound references

Pith citing papers