A primal-dual infeasible-interior-point algorithm for linear programming
From MaRDI portal
A so-called `primal-dual infeasible-interior-point algorithm' is proposed for solving linear programming problems. As usual, it takes a new point along the Newton direction at each step; however, the point taken will not be necessarily within the feasible region although within the interior of the region determined by the nonnegative constraints. So one can start from an arbitrary primal-dual pair of points with strictly positive components. A step length rule is used to ensure the global convergence of the algorithm.
Recommendations
- scientific article; zbMATH DE number 1300325
- A primal-infeasible interior point algorithm for linearly constrained convex programming
- A predictor-corrector infeasible-interior-point algorithm for linear programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
Cites work
- A General Framework of Continuation Methods for Complementarity Problems
- A little theorem of the big \({\mathcal M}\) in interior point algorithms
- A polynomial-time algorithm for a class of linear complementarity problems
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Computational experience with a primal-dual interior point method for linear programming
- Feasibility issues in a primal-dual interior-point method for linear programming
- Further Development of a Primal-Dual Interior Point Method
- Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
- Homotopy Continuation Methods for Nonlinear Complementarity Problems
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- scientific article; zbMATH DE number 4072729 (Why is no real title available?)
- scientific article; zbMATH DE number 4126998 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On some efficient interior point methods for nonlinear convex programming
- On the Implementation of a Primal-Dual Interior Point Method
- Symmetric indefinite systems for interior point methods
Cited in
(only showing first 100 items - show all)- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
- A primal projective interior point method for linear programming
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
- Steplengths in interior-point algorithms of quadratic programming
- Global convergence in infeasible-interior-point algorithms
- Superlinear convergence of infeasible-interior-point methods for linear programming
- Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming
- An infeasible-interior-point algorithm for linear complementarity problems
- Polynomiality of infeasible-interior-point algorithms for linear programming
- A predictor-corrector infeasible-interior-point algorithm for linear programming
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- A QMR-based interior-point algorithm for solving linear programs
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
- Parallel interior-point method for linear and quadratic programs with special structure
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy
- A primal-dual regularized interior-point method for convex quadratic programs
- A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
- An interior point potential reduction method for constrained equations
- A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming
- A generalized homogeneous and self-dual algorithm for linear programming
- A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
- Presolving in linear programming
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
- An infeasible-interior-point algorithm using projections onto a convex set
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
- An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
- New infeasible interior-point algorithm based on monomial method
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
- A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
- A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
- An interior point-proximal method of multipliers for convex quadratic programming
- Iterative descent method for generalized Leontief model
- An interior-point algorithm for linear programming with optimal selection of centering parameter and step size
- Status determination by interior-point methods for convex optimization problems in domain-driven form
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps
- Path-following gradient-based decomposition algorithms for separable convex optimization
- A Mehrotra type predictor-corrector interior-point algorithm for linear programming
- 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
- On the convergence of a predictor-corrector variant algorithm
- An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems
- Optimized choice of parameters in interior-point methods for linear programming
- An entire space polynomial-time algorithm for linear programming
- The \(Q\) method for second order cone programming
- New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- The complexity of self-regular proximity based infeasible IPMs
- An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
- A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils
- An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem
- Interior hybrid proximal extragradient methods for the linear monotone complementarity problem
- A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function
- From global to local convergence of interior methods for nonlinear optimization
- A modified full-Newton step infeasible interior-point algorithm for linear optimization
- A new feasible interior-point algorithm with full step for linear optimization based on a simple function
- A primal-infeasible interior point algorithm for linearly constrained convex programming
- Solving scalarized multi-objective network flow problems using an interior point method
- The practical behavior of the homogeneous self-dual formulations in interior point methods
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
- A class of infeasible interior point algorithms for convex quadratic programming
- Interior-point methods for linear programming: a review
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
- A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
- Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
- scientific article; zbMATH DE number 1203001 (Why is no real title available?)
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp∗
- scientific article; zbMATH DE number 1281610 (Why is no real title available?)
- scientific article; zbMATH DE number 1300325 (Why is no real title available?)
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Matrix-free interior point method
- scientific article; zbMATH DE number 741128 (Why is no real title available?)
- Regularization techniques in interior point methods
- scientific article; zbMATH DE number 1047678 (Why is no real title available?)
- The analyticity of interior-point-paths at strictly complementary solutions of linear programs
- Interior point methods 25 years later
- LOQO:an interior point code for quadratic programming
- A predictor-corrector algorithm with multiple corrections for convex quadratic programming
- scientific article; zbMATH DE number 1782596 (Why is no real title available?)
- An infeasible interior-point method for the \(P_*\)-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming
- An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization
- A modified infeasible-interior-point algorithm for linear optimization problems
- scientific article; zbMATH DE number 1444279 (Why is no real title available?)
- The discrete ellipsoid covering problem: a discrete geometric programming approach
- New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization
- A new predictor-corrector infeasible interior-point algorithm for linear optimization in a wide neighborhood
- 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
- A T-Algebraic Approach to Primal-Dual Interior-Point Algorithms
This page was built for publication: A primal-dual infeasible-interior-point algorithm for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315419)
