On the public citation graph
Computational experience with a globally convergent primal—dual predictor—corrector algorithm for linear programming
0 signed · 49 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4613-9617-8_8openalex-snapshot
Pathways to the Optimal Set in Linear Programming
inferredcites →https://doi.org/10.1007/bf01582151openalex-snapshot
A primal—dual infeasible-interior-point algorithm for linear programming
inferredcites →https://doi.org/10.1007/bf01582900openalex-snapshot
A potential-function reduction algorithm for solving a linear program directly from an infeasible “warm start”
inferredcites →https://doi.org/10.1016/0024-3795(91)90275-2openalex-snapshot
Computational experience with a primal-dual interior point method for linear programming
inferredcites →https://doi.org/10.1016/0047-2727(73)90031-5openalex-snapshot
Multi-level planning: Case studies in Mexico
inferredcites →https://doi.org/10.1093/comjnl/12.3.207-aopenalex-snapshot
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
inferredcites →https://doi.org/10.1137/0802022openalex-snapshot
On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
inferredcites →https://doi.org/10.1137/0802028openalex-snapshot
On the Implementation of a Primal-Dual Interior Point Method
inferredcites →https://doi.org/10.1137/0803036openalex-snapshot
Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4788840openalex-extracted
Daily Operation Scheduling and Energy Pricing in Multiple Scenarios with High Renewable Penetration and Energy Storage Systems
inferred← citeshttps://doi.org/10.1007/978-1-4613-3335-7_6openalex-snapshot
Computer Solution of Linear Programs: Non-simplex Algorithms
inferred← citeshttps://doi.org/10.1007/b97521openalex-snapshot
Differentiable Optimization and Equation Solving: A Treatise on Algorithmic Science and the Karmarkar Revolution
inferred← citeshttps://doi.org/10.1007/bf01582211openalex-snapshot
An infeasible-interior-point algorithm for linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf01582228openalex-snapshot
A quadratically convergent predictor—corrector method for solving linear programs from infeasible starting points
inferred← citeshttps://doi.org/10.1007/bf02206809openalex-snapshot
Basic lemmas in polynomial-time infeasible-interiorpoint methods for linear programs
inferred← citeshttps://doi.org/10.1007/bf02206812openalex-snapshot
AnO(nL) infeasible-interior-point algorithm for LCP with quadratic convergence
inferred← citeshttps://doi.org/10.1007/bf02206815openalex-snapshot
A simplified homogeneous and self-dual linear programming algorithm and its implementation
inferred← citeshttps://doi.org/10.1007/bf02206818openalex-snapshot
A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
inferred← citeshttps://doi.org/10.1007/bf02680554openalex-snapshot
Warm start of the primal-dual method applied in the cutting-plane scheme
inferred← citeshttps://doi.org/10.1007/s10107-005-0603-6openalex-snapshot
Primal-dual nonlinear rescaling method with dynamic scaling parameter update
inferred← citeshttps://doi.org/10.1007/s10589-007-9023-2openalex-snapshot
A Newton’s method for perturbed second-order cone programs
inferred← citeshttps://doi.org/10.1007/s10998-016-0119-2openalex-snapshot
Complexity analysis of a full-Newton step interior-point method for linear optimization
inferred← citeshttps://doi.org/10.1016/s0167-6377(99)00028-0openalex-snapshot
Steplengths in interior-point algorithms of quadratic programming
inferred← citeshttps://doi.org/10.1023/a:1018343420495openalex-snapshot
A Constant-Potential Infeasible-Start Interior-Point Algorithm with Computational Experiments and Applications
inferred← citeshttps://doi.org/10.1023/b:jota.0000041733.24606.99openalex-snapshot
Primal-Dual Nonlinear Rescaling Method for Convex Optimization
inferred← citeshttps://doi.org/10.1029/98wr02771openalex-snapshot
Surface water quality management using a multiple‐realization chance constraint method
inferred← citeshttps://doi.org/10.1049/ip-gtd:20010009openalex-snapshot
Efficient two-level interior point method for optimal pumped hydrostorage scheduling exploiting the nonsparse matrix structure
inferred← citeshttps://doi.org/10.1080/02533839.2001.9670650openalex-snapshot
On the improvement of convergence characteristics of PCPDIPA
inferred← citeshttps://doi.org/10.1080/10556780802367239openalex-snapshot
Optimization and dynamical systems algorithms for finding equilibria of stochastic games
inferred← citeshttps://doi.org/10.1109/59.708701openalex-snapshot
A comparison of interior-point codes for medium-term hydro-thermal coordination
inferred← citeshttps://doi.org/10.1109/59.761902openalex-snapshot
Improving an interior-point-based OPF by dynamic adjustments of step sizes and tolerances
inferred← citeshttps://doi.org/10.1109/59.852117openalex-snapshot
Interior-point methods and their applications to power systems: a classification of publications and software codes
inferred← citeshttps://doi.org/10.1109/apt.1993.686869openalex-snapshot
A Nonlinear Programming Approach Based on an Interior Point Method for Optimal Power Flows
inferred← citeshttps://doi.org/10.1109/bibm52615.2021.9669759openalex-snapshot
Dynamic Restricted Column Generation in MIQP for Cancer Radiation Therapy
inferred← citeshttps://doi.org/10.1109/pica.1997.599400openalex-snapshot
A comparison of interior-point codes for medium-term hydro-thermal coordination
inferred← citeshttps://doi.org/10.1137/060678129openalex-snapshot
A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis
inferred← citeshttps://doi.org/10.1137/080742786openalex-snapshot
On Interior-Point Warmstarts for Linear and Combinatorial Optimization
inferred← citeshttps://doi.org/10.1137/s0895479894271093openalex-snapshot
Stability of Augmented System Factorizations in Interior-Point Methods
inferred← citeshttps://doi.org/10.1137/s1052623494267826openalex-snapshot
A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity
inferred← citeshttps://doi.org/10.1137/s1052623497329993openalex-snapshot
Convergence Analysis of Inexact Infeasible-Interior-Point Algorithms for Solving Linear Programming Problems
inferred← citeshttps://doi.org/10.1145/192115.192153openalex-snapshot
A primal null-space affine-scaling method
inferred← citeshttps://doi.org/10.48550/arxiv.2003.10888openalex-snapshot
A Randomized Nonlinear Rescaling Method in Large-Scale Constrained Convex Optimization
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.