Feasibility issues in a primal-dual interior-point method for linear programming
From MaRDI portal
Publication:803044
DOI10.1007/BF01588785zbMath0726.90050OpenAlexW2094757704WikidataQ60140263 ScholiaQ60140263MaRDI QIDQ803044
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
Numerical mathematical programming methods (65K05) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization, Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier, An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones, A new infeasible interior-point algorithm with full step for linear optimization based on a simple function, Global convergence in infeasible-interior-point algorithms, Combining phase I and phase II in a potential reduction algorithm for linear programming, A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A SELF-REGULAR PROXIMITY, Polynomiality of infeasible-interior-point algorithms for linear programming, A wide neighborhood infeasible-interior-point method with arc-search for linear programming, The practical behavior of the homogeneous self-dual formulations in interior point methods, Infeasible interior-point methods for linear optimization based on large neighborhood, Status determination by interior-point methods for convex optimization problems in domain-driven form, Linear programming with stochastic elements: An on-line approach, A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization, A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems, Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs, An infeasible-interior-point algorithm using projections onto a convex set, Gigaflops in linear programming, A primal-dual potential reduction method for problems involving matrix inequalities, A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming, Primal-dual methods for linear programming, An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function, A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems, A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems, A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term, An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization, A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps, Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step, An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems, A new search direction for full-Newton step infeasible interior-point method in linear optimization, Finding a strict feasible solution of a linear semidefinite program, Full Nesterov-Todd step infeasible interior-point method for symmetric optimization, Unnamed Item, An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood, On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods, A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization, 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, New complexity analysis of IIPMs for linear optimization based on a specific self-regular function, A brief description of ALPO, A new class of infeasible interior-point algorithm for linear complementarity problem, An infeasible full-NT step interior point algorithm for CQSCO, A little theorem of the big \({\mathcal M}\) in interior point algorithms, An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization, On combined phase 1-phase 2 projective methods for linear programming, Convergence of the homotopy path for a full-Newton step infeasible interior-point method, Implementation of interior point methods for mixed semidefinite and second order cone optimization problems, A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization, Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization, An infeasible interior point method for the monotone SDLCP based on a transformation of the central path, Primal-Dual Interior-Point Methods for Domain-Driven Formulations, The complexity of self-regular proximity based infeasible IPMs, A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization, Simplified infeasible interior-point algorithm for linear optimization based on a simple function, An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem, 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, Symmetric indefinite systems for interior point methods, A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function, A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem, An adaptive infeasible interior-point algorithm for linear complementarity problems, Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem, An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step, An interior point potential reduction method for constrained equations, Quadratically constrained convex quadratic programmes: Faculty feasible regions, Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function, New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization, Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming, A primal-dual interior-point method based on a new kernel function for linear complementarity problem, Unnamed Item, LOQO:an interior point code for quadratic programming, A primal-dual infeasible-interior-point algorithm for linear programming, Computational experience with a primal-dual interior point method for linear programming, Optimizing over three-dimensional subspaces in an interior-point method for linear programming, Unnamed Item, Finding a strict feasible dual solution of a convex optimization problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- An analysis of an available set of linear programming test problems
- 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
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A variation on Karmarkar’s algorithm for solving linear programming problems
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Further Development of a Primal-Dual Interior Point Method
- The multifrontal method and paging in sparse Cholesky factorization
