A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization

DOI10.1137/050623917zbMath1131.90029OpenAlexW2034177488MaRDI QIDQ5470235

Cornelis Roos

Publication date: 30 May 2006

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050623917

zbMATH Keywords

interior-point methodprimal-dual methodlinear optimizationpolynomial complexityinfeasible method

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Related Items (89)

A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization ⋮ An infeasible full NT-step interior point method for circular 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 ⋮ Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function ⋮ A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP ⋮ A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function ⋮ A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming ⋮ Infeasible interior-point methods for linear optimization based on large neighborhood ⋮ Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems ⋮ A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function ⋮ An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path ⋮ An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function ⋮ Full Nesterov–Todd step feasible interior-point method for the CartesianP_*(κ)-SCLCP ⋮ A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS ⋮ Simplified analysis of a full Nesterov–Todd step infeasible interior-point method for symmetric optimization ⋮ A polynomial interior-point algorithm for monotone linear complementarity problems ⋮ A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization ⋮ A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization ⋮ A polynomial arc-search interior-point algorithm 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 for \(P_\ast (\kappa)\) linear complementarity problem ⋮ 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 new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric 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 ⋮ Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions ⋮ A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions ⋮ A new search direction for full-Newton step infeasible interior-point method in linear optimization ⋮ A full NT-step infeasible interior-point algorithm for semidefinite optimization ⋮ Full Nesterov-Todd step infeasible interior-point method for symmetric optimization ⋮ An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones ⋮ A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function ⋮ An entire space polynomial-time algorithm for linear programming ⋮ Unnamed Item ⋮ A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization ⋮ A Corrector-Predictor Interior-Point Algorithm for P_∗(κ)-HLCPs Over Cartesian Product of Symmetric Cones ⋮ A new infeasible interior-point method based on Darvay's technique for symmetric optimization ⋮ Full-NT step infeasible interior-point method for SOCO based on a specific kernel function ⋮ A generalized direction in interior point method for monotone linear complementarity problems ⋮ Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function ⋮ Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization ⋮ A modified infeasible-interior-point algorithm for linear optimization problems ⋮ An infeasible interior-point algorithm with full-Newton step for linear optimization ⋮ An infeasible full-NT step interior point algorithm for CQSCO ⋮ A long-step interior-point algorithm for symmetric cone Cartesian P_*(κ)-HLCP ⋮ A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems ⋮ Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming ⋮ An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization ⋮ A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION BASED ON AN EXPONENTIAL KERNEL FUNCTION ⋮ Convergence of the homotopy path for a full-Newton step infeasible interior-point method ⋮ Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence ⋮ An adaptive updating full-Newton step interior-point algorithm with modified Newton direction ⋮ A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization ⋮ SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps ⋮ Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization ⋮ A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem ⋮ An infeasible interior point method for the monotone SDLCP based on a transformation of the central path ⋮ A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP_*(κ) horizontal linear complementarity problems over symmetric cones ⋮ Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP ⋮ A New Infeasible Interior-Point Method Based on a Non-Coercive Kernel Function with Improved Centering Steps for Second-Order Cone Optimization ⋮ A full-modified-Newton step infeasible interior-point algorithm for linear optimization ⋮ A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step ⋮ A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization ⋮ An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones ⋮ 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 full-Newton step infeasible interior-point method for the special weighted linear complementarity problem ⋮ An adaptive infeasible interior-point algorithm for linear complementarity problems ⋮ An improved and modified infeasible interior-point method for symmetric optimization ⋮ An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step ⋮ Unnamed Item ⋮ Relaxing high-dimensional constraints in the direct solution space method for early phase development ⋮ 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 primal-dual interior-point method based on a new kernel function for linear complementarity problem ⋮ A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem ⋮ Unnamed Item ⋮ Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization ⋮ Unnamed Item ⋮ A MODIFIED FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION ⋮ Steplength thresholds for invariance preserving of discretization methods of dynamical systems on a polyhedron ⋮ An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem

Uses Software

• SeDuMi

This page was built for publication: A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization