A simplified homogeneous and self-dual linear programming algorithm and its implementation

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
On the Implementation of a Primal-Dual Interior Point Method
On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
Finding an interior point in the optimal face of linear programs
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
A primal-dual infeasible-interior-point algorithm for linear programming
A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming
Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming

Cited In (24)

Active-set prediction for interior point methods using controlled perturbations
The practical behavior of the homogeneous self-dual formulations in interior point methods
Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
Performance enhancements for a generic conic interior point algorithm
Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
Advances in the simulation of viscoplastic fluid flows using interior-point methods
On homogeneous and self-dual algorithms for LCP
Status determination by interior-point methods for convex optimization problems in domain-driven form
Interior Point Methods for Nonlinear Optimization
An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
Computational experience with a modified potential reduction algorithm for linear programming
A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem
Title not available (Why is that?)
An ADMM-based interior-point method for large-scale linear programming
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
On the behavior of the homogeneous self-dual model for conic convex optimization
On implementation of a self-dual embedding method for convex programming
Conic optimization via operator splitting and homogeneous self-dual embedding
A primal-dual decomposition algorithm for multistage stochastic convex programming
Design and implementation of a modular interior-point solver for linear optimization
Interior-point methods for linear programming: a review
Conic convex programming and self-dual embedding
Deriving potential functions via a symmetry principle for nonlinear equations

Uses Software

HOPDM
NETLIB LP Test Set

This page was built for publication: A simplified homogeneous and self-dual linear programming algorithm and its implementation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1915910)