A primal-dual infeasible-interior-point algorithm for linear programming

From MaRDI portal

Publication:1315419

Jump to:navigation, search

DOI10.1007/BF01582151zbMath0808.90093MaRDI QIDQ1315419

Nimrod Megiddo, Shinji Mizuno, Kojima, Masakazu

Publication date: 10 March 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

global convergence primal-dual infeasible-interior-point algorithm step length rule

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51) 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, A new infeasible interior-point algorithm with full step for linear optimization based on a simple function, 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, 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 primal-dual infeasible-interior-point algorithm for linear semi- infinite programming, A combined homotopy interior point method for the linear complementarity problem, Unnamed Item, Status determination by interior-point methods for convex optimization problems in domain-driven form, A QMR-based interior-point algorithm for solving linear programs, A generalized homogeneous and self-dual algorithm for linear programming, An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming, Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization, ON THE PROPERTIES OF ∊-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING, Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization, Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems, An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems, 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, A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization, A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils, A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy, A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems, Optimized choice of parameters in interior-point methods for linear programming, 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, Matrix-free interior point method, Full Nesterov-Todd step infeasible interior-point method for symmetric optimization, Regularization techniques in interior point methods, Interior point methods 25 years later, An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming, An entire space polynomial-time algorithm for linear programming, A predictor-corrector algorithm with multiple corrections for convex quadratic programming, The \(Q\) method for second order cone programming, Solving scalarized multi-objective network flow problems using an interior point method, 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, The discrete ellipsoid covering problem: a discrete geometric programming approach, A new class of infeasible interior-point algorithm for linear complementarity problem, An infeasible full-NT step interior point algorithm for CQSCO, Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming, The double pivot simplex method, Path-following gradient-based decomposition algorithms for separable convex optimization, An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming, An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization, The analyticity of interior-point-paths at strictly complementary solutions of linear programs, A primal-dual regularized interior-point method for convex quadratic programs, Convergence of the homotopy path for a full-Newton step infeasible interior-point method, 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, A Mehrotra type predictor-corrector interior-point algorithm for linear programming, 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, An interior point-proximal method of multipliers for convex quadratic programming, Primal-Dual Interior-Point Methods for Domain-Driven Formulations, The complexity of self-regular proximity based infeasible IPMs, Computational experience with a modified potential reduction algorithm for linear programming, A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming, 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, 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, A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points, Matrix-free interior point method for compressed sensing problems, Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming, Iterative descent method for generalized Leontief model, 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, An interior-point algorithm for linear programming with optimal selection of centering parameter and step size, 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, A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood, 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, Steplengths in interior-point algorithms of quadratic programming, Solving large-scale linear programs by interior-point methods under the Matlab^∗Environment^†, LOQO:an interior point code for quadratic programming, From global to local convergence of interior methods for nonlinear optimization, Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp^∗, A MODIFIED FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION, Parallel interior-point method for linear and quadratic programs with special structure, On the convergence of a predictor-corrector variant algorithm, Interior-point methods for linear programming: a review, An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems, Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques, Unnamed Item, A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION BASED ON AN EXPONENTIAL KERNEL FUNCTION, Solving linear systems in interior-point methods, 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

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1315419&oldid=13430029"