Feasibility issues in a primal-dual interior-point method for linear programming
From MaRDI portal
Publication:803044
DOI10.1007/BF01588785zbMATH Open0726.90050OpenAlexW2094757704WikidataQ60140263 ScholiaQ60140263MaRDI QIDQ803044FDOQ803044
Authors: Irvin Lustig 
Publication date: 1990
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01588785
Recommendations
- A primal-dual infeasible-interior-point algorithm for linear programming
- A feasible primal-dual interior point method for linear semidefinite programming
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems
- A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems
- scientific article; zbMATH DE number 1281610
- scientific article
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming
Numerical mathematical programming methods (65K05) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Interior path following primal-dual algorithms. I: Linear programming
- A practical anti-cycling procedure for linearly constrained optimization
- An implementation of Karmarkar's algorithm for linear programming
- Title not available (Why is that?)
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- A modification of Karmarkar's linear programming algorithm
- An analysis of an available set of linear programming test problems
- Further Development of a Primal-Dual Interior Point Method
- The multifrontal method and paging in sparse Cholesky factorization
Cited In (77)
- An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem
- Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step
- A little theorem of the big \({\mathcal M}\) in interior point algorithms
- Finding a strict feasible dual solution of a convex optimization problem
- A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
- An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood
- Gigaflops in linear programming
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- Finding a strict feasible solution of a linear semidefinite program
- A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization
- A primal-dual potential reduction method for problems involving matrix inequalities
- On combined phase 1-phase 2 projective methods for linear programming
- Quadratically constrained convex quadratic programmes: Faculty feasible regions
- Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- Symmetric indefinite systems for interior point methods
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
- The practical behavior of the homogeneous self-dual formulations in interior point methods
- Infeasible interior-point methods for linear optimization based on large neighborhood
- An infeasible-interior-point algorithm using projections onto a convex set
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- Full-Newton step infeasible interior-point algorithm for SDO problems
- LOQO:an interior point code for quadratic programming
- A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term
- Combining phase I and phase II in a potential reduction algorithm for linear programming
- The complexity of self-regular proximity based infeasible IPMs
- Primal-dual methods for linear programming
- An adaptive infeasible interior-point algorithm for linear complementarity problems
- Convergence of the homotopy path for a full-Newton step infeasible interior-point method
- Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization
- Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function
- Polynomiality of infeasible-interior-point algorithms for linear programming
- A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
- A primal-dual infeasible-interior-point algorithm for linear programming
- A full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
- An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function
- A brief description of ALPO
- A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
- A modified infeasible-interior-point algorithm for linear optimization problems
- An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization
- An infeasible full-NT step interior point algorithm for CQSCO
- New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization
- New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
- A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems
- A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems
- Linear programming with stochastic elements: An on-line approach
- Optimizing over three-dimensional subspaces in an interior-point method for linear programming
- Global convergence in infeasible-interior-point algorithms
- A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function
- A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
- Computational experience with a primal-dual interior point method for linear programming
- An interior point potential reduction method for constrained equations
- On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods
- A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization
- A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
- An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems
- An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones
- A primal-dual interior-point method based on a new kernel function for linear complementarity problem
- Primal-dual interior-point methods for domain-driven formulations
- A new infeasible interior-point algorithm for linear complementarity problem
- Status determination by interior-point methods for convex optimization problems in domain-driven form
- A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem
- An infeasible interior-point method for the \(P_*\)-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
- A new feasible interior-point algorithm with full step for linear optimization based on a simple function
- A new search direction for full-Newton step infeasible interior-point method in linear optimization
- Entering into the domain of feasible solutions using interior point method
- Simplified infeasible interior-point algorithm for linear optimization based on a simple function
- A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps
- A review of termination rules of an inexact primal-dual interior point method for linear programming problems
- Title not available (Why is that?)
Uses Software
This page was built for publication: Feasibility issues in a primal-dual interior-point method for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803044)
