SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
From MaRDI portal
Publication:5436917
DOI10.1080/10556780600816692zbMath1186.90077OpenAlexW2045591006MaRDI QIDQ5436917
No author found.
Publication date: 18 January 2008
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780600816692
Related Items (27)
A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A SELF-REGULAR PROXIMITY ⋮ A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ−1) iteration complexity ⋮ 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 infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function ⋮ A polynomial interior-point algorithm for monotone linear complementarity problems ⋮ Two wide neighborhood interior-point methods for symmetric cone optimization ⋮ A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization ⋮ A full-Newton step \(O(n)\) infeasible-interior-point algorithm for 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 ⋮ Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step ⋮ A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions ⋮ An entire space polynomial-time algorithm for linear programming ⋮ A predictor-corrector algorithm with multiple corrections for convex quadratic programming ⋮ Full-NT step infeasible interior-point method for SOCO based on a specific kernel function ⋮ Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function ⋮ A new class of infeasible interior-point algorithm for linear complementarity problem ⋮ An infeasible interior-point algorithm with full-Newton step for linear optimization ⋮ An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization ⋮ Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization ⋮ A full-modified-Newton step infeasible interior-point algorithm for linear optimization ⋮ A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization ⋮ 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 predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity ⋮ A primal-dual interior-point method based on a new kernel function for linear complementarity problem
Cites Work
- Polynomiality of infeasible-interior-point algorithms for linear programming
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Unnamed Item
- Unnamed Item
This page was built for publication: SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
