On the public citation graph
A simplified homogeneous and self-dual linear programming algorithm and its implementation
0 signed · 117 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/bf01581140openalex-snapshot
Computational experience with a globally convergent primal—dual predictor—corrector algorithm for 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/bf01585180openalex-snapshot
Finding an interior point in the optimal face of linear programs
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.1287/moor.18.4.964openalex-snapshot
On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
inferredcites →https://doi.org/10.1287/moor.19.1.53openalex-snapshot
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
inferredcites →https://doi.org/10.1287/moor.20.1.135openalex-snapshot
A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_200openalex-snapshot
Entropy optimization: Interior point methods; Interior point methods for semidefinite programming; Linear programming: Interior point methods; Linear programming: Karmarkar projective algorithm; Potential reduction methods for linear programming; Sequential quadratic programming: Interior point…
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_262openalex-snapshot
Linear Programming: Interior Point Methods
inferred← citeshttps://doi.org/10.1007/978-0-387-21757-4_5openalex-snapshot
An Interior-Point Approach to Multi-Stage Stochastic Programming
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_269openalex-snapshot
Homogeneous Selfdual Methods for Linear Programming
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_337openalex-snapshot
Linear Programming: Interior Point Methods
inferred← citeshttps://doi.org/10.1007/978-1-4613-3449-1_1openalex-snapshot
Introduction to the Theory of Interior Point Methods
inferred← citeshttps://doi.org/10.1007/978-1-4613-3449-1_11openalex-snapshot
Interior Point Methods for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3449-1_6openalex-snapshot
Implementation of Interior-Point Methods for Large Scale Linear Programs
inferred← citeshttps://doi.org/10.1007/978-1-4757-3216-0_18openalex-snapshot
Interior Point Methods: Current Status and Future Directions
inferred← citeshttps://doi.org/10.1007/978-1-4757-3216-0_8openalex-snapshot
The Mosek Interior Point Optimizer for Linear Programming: An Implementation of the Homogeneous Algorithm
inferred← citeshttps://doi.org/10.1007/978-1-4757-3333-4_10openalex-snapshot
A Homogenized Cutting Plane Method to Solve the Convex Feasibility Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-39415-8_22openalex-snapshot
The Homogeneous Self-Dual Method
inferred← citeshttps://doi.org/10.1007/978-3-642-11339-0_4openalex-snapshot
Interior Point Methods for Nonlinear Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_10openalex-snapshot
Integer Linear Programming (ILP)
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_14openalex-snapshot
Dual Simplex Phase-l Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_16openalex-snapshot
Improved Reduced Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_17openalex-snapshot
D-Reduced Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_18openalex-snapshot
Criss-Cross Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_19openalex-snapshot
Generalizing Reduced Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_2openalex-snapshot
Geometry of the Feasible Region
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_21openalex-snapshot
Dual Deficient-Basis Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_24openalex-snapshot
Pivotal Interior-Point Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_4openalex-snapshot
Duality Principle and Dual Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_5openalex-snapshot
Implementation of the Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_6openalex-snapshot
Sensitivity Analysis and Parametric LP
inferred← citeshttps://doi.org/10.1007/978-3-642-40754-3_7openalex-snapshot
Variants of the Simplex Method
inferred← citeshttps://doi.org/10.1007/bf01584841openalex-snapshot
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
inferred← citeshttps://doi.org/10.1007/bf02206813openalex-snapshot
A path-following interior-point algorithm for linear and quadratic problems
inferred← citeshttps://doi.org/10.1007/bf02614383openalex-snapshot
A QMR-based interior-point algorithm for solving linear programs
inferred← citeshttps://doi.org/10.1007/bf02614384openalex-snapshot
On homogeneous and self-dual algorithms for LCP
inferred← citeshttps://doi.org/10.1007/pl00011413openalex-snapshot
On two homogeneous self-dual approaches to linear programming and its extensions
inferred← citeshttps://doi.org/10.1007/s00477-012-0629-2openalex-snapshot
A dual two-stage stochastic model for flood management with inexact-integer analysis under multiple uncertainties
inferred← citeshttps://doi.org/10.1007/s10100-013-0336-1openalex-snapshot
The practical behavior of the homogeneous self-dual formulations in interior point methods
inferred← citeshttps://doi.org/10.1007/s10107-002-0349-3openalex-snapshot
On implementing a primal-dual interior-point method for conic quadratic optimization
inferred← citeshttps://doi.org/10.1007/s10107-005-0575-6openalex-snapshot
A Primal-Dual Decomposition Algorithm for Multistage Stochastic Convex Programming
inferred← citeshttps://doi.org/10.1007/s10107-005-0667-3openalex-snapshot
On the behavior of the homogeneous self-dual model for conic convex optimization
inferred← citeshttps://doi.org/10.1007/s10107-014-0773-1openalex-snapshot
A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
inferred← citeshttps://doi.org/10.1007/s10107-021-01663-wopenalex-snapshot
Status determination by interior-point methods for convex optimization problems in domain-driven form
inferred← citeshttps://doi.org/10.1007/s101070050027openalex-snapshot
On a homogeneous algorithm for the monotone complementarity problem
inferred← citeshttps://doi.org/10.1007/s101070050091openalex-snapshot
An infeasible-interior-point potential-reduction algorithm for linear programming
inferred← citeshttps://doi.org/10.1007/s10589-013-9540-0openalex-snapshot
An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
inferred← citeshttps://doi.org/10.1007/s10589-015-9791-zopenalex-snapshot
Active-set prediction for interior point methods using controlled perturbations
inferred← citeshttps://doi.org/10.1007/s10957-016-0892-3openalex-snapshot
Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
inferred← citeshttps://doi.org/10.1007/s11063-025-11746-wopenalex-snapshot
Predict-and-Optimize Techniques for Data-Driven Optimization Problems: A Review
inferred← citeshttps://doi.org/10.1007/s11590-015-0940-1openalex-snapshot
A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem
inferred← citeshttps://doi.org/10.1007/s12532-012-0046-zopenalex-snapshot
Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
inferred← citeshttps://doi.org/10.1007/s12532-020-00200-8openalex-snapshot
Design and implementation of a modular interior-point solver for linear optimization
inferred← citeshttps://doi.org/10.1007/s12532-022-00226-0openalex-snapshot
Performance enhancements for a generic conic interior point algorithm
inferred← citeshttps://doi.org/10.1007/s12532-025-00301-2openalex-snapshot
GeNIOS: an (almost) second-order operator-splitting solver for large-scale convex optimization
inferred← citeshttps://doi.org/10.1016/0167-6377(95)00002-2openalex-snapshot
A generalized homogeneous and self-dual algorithm for linear programming
inferred← citeshttps://doi.org/10.1016/j.cma.2017.11.006openalex-snapshot
Advances in the simulation of viscoplastic fluid flows using interior-point methods
inferred← citeshttps://doi.org/10.1016/j.ecolmodel.2009.12.012openalex-snapshot
Identification of optimal strategies for improving eco-resilience to floods in ecologically vulnerable regions of a wetland
inferred← citeshttps://doi.org/10.1016/j.epsr.2008.02.002openalex-snapshot
Hydrothermal self-scheduling problem in a day-ahead electricity market
inferred← citeshttps://doi.org/10.1016/j.ijepes.2012.03.051openalex-snapshot
Unit commitment problem in deregulated environment
inferred← citeshttps://doi.org/10.1016/j.procs.2021.10.035openalex-snapshot
The mathematically best way to spend your money: an algorithm for optimising the cashback profit
inferred← citeshttps://doi.org/10.1016/s0167-6377(97)00038-2openalex-snapshot
Deriving potential functions via a symmetry principle for nonlinear equations
inferred← citeshttps://doi.org/10.1016/s0377-2217(00)00094-1openalex-snapshot
An easy way to teach interior-point methods
inferred← citeshttps://doi.org/10.1017/s0962492906370018openalex-snapshot
Interior-point methods for optimization
inferred← citeshttps://doi.org/10.1023/a:1018369223322openalex-snapshot
A Computational Study of the Homogeneous Algorithm for Large-scale Convex Optimization
inferred← citeshttps://doi.org/10.1023/a:1021850032714openalex-snapshot
Postponing the Choice of Penalty Parameter and Step Length
inferred← citeshttps://doi.org/10.1023/b:jogo.0000047915.10754.a1openalex-snapshot
A New Self-Dual Embedding Method for Convex Programming
inferred← citeshttps://doi.org/10.1038/sj.jors.2600987openalex-snapshot
Linear Programming: Foundations and Extensions
inferred← citeshttps://doi.org/10.1080/00207390110119934openalex-snapshot
Interior-point methods for linear programming: a review
inferred← citeshttps://doi.org/10.1080/10556780008805800openalex-snapshot
Conic convex programming and self-dual embedding
inferred← citeshttps://doi.org/10.1080/1055678021000045123openalex-snapshot
Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
inferred← citeshttps://doi.org/10.1080/10556780500065317openalex-snapshot
On implementation of a self-dual embedding method for convex programming
inferred← citeshttps://doi.org/10.1080/10556788.2011.634911openalex-snapshot
Computational experience with a modified potential reduction algorithm for linear programming
inferred← citeshttps://doi.org/10.1080/10556788.2020.1821200openalex-snapshot
An ADMM-based interior-point method for large-scale linear programming
inferred← citeshttps://doi.org/10.1080/10556789908805762openalex-snapshot
SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
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/59.867148openalex-snapshot
A study of the homogeneous algorithm for dynamic economic dispatch with network constraints and transmission losses
inferred← citeshttps://doi.org/10.1109/59.871715openalex-snapshot
A homogeneous linear programming algorithm for the security constrained economic dispatch problem
inferred← citeshttps://doi.org/10.1109/cca.2013.6662814openalex-snapshot
A riccati based homogeneous and self-dual interior-point method for linear economic model predictive control
inferred← citeshttps://doi.org/10.1109/cdc.2013.6760449openalex-snapshot
A warm-started homogeneous and self-dual interior-point method for linear economic model predictive control
inferred← citeshttps://doi.org/10.1109/cdc45484.2021.9682847openalex-snapshot
Homogeneous Formulation of Convex Quadratic Programs for Infeasibility Detection
inferred← citeshttps://doi.org/10.1109/cdc51059.2022.9992979openalex-snapshot
Homogeneous Infeasible Interior Point Method for Convex Quadratic Programs
inferred← citeshttps://doi.org/10.1109/tac.2015.2495558openalex-snapshot
A Homogeneous and Self-Dual Interior-Point Linear Programming Algorithm for Economic Model Predictive Control
inferred← citeshttps://doi.org/10.1109/tac.2025.3631575openalex-snapshot
EIQP: Execution-Time-Certified and Infeasibility-Detecting QP Solver
inferred← citeshttps://doi.org/10.1109/twc.2025.3533659openalex-snapshot
Max-Min Beamforming for Large-Scale Cell-Free Massive MIMO: A Randomized ADMM Algorithm
inferred← citeshttps://doi.org/10.1137/s0895479893260498openalex-snapshot
Stability of Linear Equations Solvers in Interior-Point Methods
inferred← citeshttps://doi.org/10.1137/s0895479894271093openalex-snapshot
Stability of Augmented System Factorizations in Interior-Point Methods
inferred← citeshttps://doi.org/10.1137/s1052623496304712openalex-snapshot
Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming
inferred← citeshttps://doi.org/10.11509/isciesci.42.6_334openalex-snapshot
最適化アルゴリズムの新展開 : 内点法とその周辺II : 線形計画問題に対する主双対内点法
inferred← citeshttps://doi.org/10.11509/isciesci.43.6_308openalex-snapshot
最適化アルゴリズムの新展開 : 内点法とその周辺VIII : 補足とまとめ
inferred← citeshttps://doi.org/10.1287/ijoc.1040.0112openalex-snapshot
Scenario Formulation of Stochastic Linear Programs and the Homogeneous Self-Dual Interior-Point Method
inferred← citeshttps://doi.org/10.1287/ijoc.2016.0715openalex-snapshot
Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method
inferred← citeshttps://doi.org/10.1287/ijoc.9.1.73openalex-snapshot
Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
inferred← citeshttps://doi.org/10.1287/opre.50.5.904.360openalex-snapshot
A Primal-Dual Decomposition-Based Interior Point Approach to Two-Stage Stochastic Linear Programming
inferred← citeshttps://doi.org/10.1561/2600000008openalex-snapshot
Operator Splitting Methods in Control
inferred← citeshttps://doi.org/10.2172/432434openalex-snapshot
A path-following interior-point algorithm for linear and quadratic problems
inferred← citeshttps://doi.org/10.4018/978-1-4666-9644-0.ch021openalex-snapshot
Verification of Iterative Methods for the Linear Complementarity Problem
inferred← citeshttps://doi.org/10.47749/t/unicamp.2000.182478openalex-snapshot
Escolha adiada do parametro de penalização e do tamanho de passo em algoritmos de pontos interiores
inferred← citeshttps://doi.org/10.48550/arxiv.2010.13943openalex-snapshot
Interior Point Solving for LP-based prediction+optimisation
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.