Feasibility issues in a primal-dual interior-point method for linear programming
From MaRDI portal
The author proposes a new method (based on the generic primal-dual algorithm) for obtaining an initial feasible interior-point solution to a linear program which avoids the use of a ``big-\({\mathcal M}\).
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; zbMATH DE number 4164543
- 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
Cites work
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- A practical anti-cycling procedure for linearly constrained optimization
- A variation on Karmarkar’s algorithm for solving linear programming problems
- An analysis of an available set of linear programming test problems
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- An implementation of Karmarkar's algorithm for linear programming
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- Further Development of a Primal-Dual Interior Point Method
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3301975 (Why is no real title available?)
- Interior path following primal-dual algorithms. I: Linear programming
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- The multifrontal method and paging in sparse Cholesky factorization
Cited in
(83)- A brief description of ALPO
- On combined phase 1-phase 2 projective methods for linear programming
- Quadratically constrained convex quadratic programmes: Faculty feasible regions
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- Global convergence in infeasible-interior-point algorithms
- Polynomiality of infeasible-interior-point algorithms for linear programming
- Linear programming with stochastic elements: An on-line approach
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization
- An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function
- An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood
- Symmetric indefinite systems for interior point methods
- An interior point potential reduction method for constrained equations
- 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
- Primal-dual methods for linear programming
- A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
- A full-Newton step infeasible interior-point method for the special weighted 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 based on a trigonometric kernel function without centering steps
- 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
- Entering into the domain of feasible solutions using interior point method
- Simplified infeasible interior-point algorithm for linear optimization based on a simple function
- Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function
- An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones
- Combining phase I and phase II in a potential reduction algorithm for linear programming
- New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
- The complexity of self-regular proximity based infeasible IPMs
- Finding a strict feasible dual solution of a convex optimization problem
- An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem
- A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function
- A new feasible interior-point algorithm with full step for linear optimization based on a simple function
- A full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity
- 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
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
- Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step
- scientific article; zbMATH DE number 1281610 (Why is no real title available?)
- scientific article; zbMATH DE number 1282260 (Why is no real title available?)
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- LOQO:an interior point code for quadratic programming
- An infeasible interior-point method for the \(P_*\)-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
- Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem
- Full-Newton step infeasible interior-point algorithm for SDO problems
- An adaptive infeasible interior-point algorithm with full-Newton step 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 full Nesterov-Todd step infeasible interior point method for second-order cone optimization
- A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization
- An infeasible full-NT step interior point algorithm for CQSCO
- Primal-dual interior-point methods for domain-driven formulations
- A review of termination rules of an inexact primal-dual interior point method for linear programming problems
- scientific article; zbMATH DE number 4197738 (Why is no real title available?)
- A primal-dual interior-point method based on a new kernel function for linear complementarity problem
- A new infeasible interior-point algorithm for 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
- A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- Implementation of infeasible interior-point methods based on a new search direction
- 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
- A little theorem of the big \({\mathcal M}\) in interior point algorithms
- Experimental results of model predictive control of a coupled tank system using interior-point barrier algorithm
- A method for uncertain linear optimization problems through polytopic approximation of the uncertainty set
- An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
- An infeasible interior-point algorithm for monotone linear complementarity problems based on a finite hyperbolic kernel function.
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- An adaptive infeasible interior-point algorithm for linear complementarity problems
- 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
- An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization
- 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
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)
