An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization
From MaRDI portal
Publication:4916322
DOI10.1080/02331934.2011.611881zbMath1270.90030OpenAlexW1987530871MaRDI QIDQ4916322
No author found.
Publication date: 22 April 2013
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2011.611881
Related Items (6)
A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization ⋮ An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization ⋮ A modified infeasible-interior-point algorithm for linear optimization problems ⋮ A full-modified-Newton step infeasible interior-point algorithm for linear optimization ⋮ An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem ⋮ An adaptive infeasible interior-point algorithm for linear complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- Feasibility issues in a primal-dual interior-point method for linear programming
- A computational study of the homogeneous algorithm for large-scale convex optimization
- On quadratic convergence of the \(O(\sqrt nL)\)-iteration homogeneous and self-dual linear programming algorithm
- A primal-dual infeasible-interior-point algorithm for linear programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
This page was built for publication: An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization