An infeasible interior-point algorithm with full-Newton step for linear optimization
From MaRDI portal
The linear optimization problem in the standard form with linear equality constraints and its dual are considered. For solving the problems, the authors propose a primal-dual infeasible interior-point algorithm that uses a feasibility step different from that one used by \textit{C. Roos} [SIAM J. Optim. 16, No. 4, 1110--1136 (2006; Zbl 1131.90029)]. The new feasibility step proposed by the authors contains as a special case the feasibility step proposed by \textit{H. Mansouri} and \textit{C. Roos} [Optim. Methods Softw. 22, No. 3, 519--530 (2007; Zbl 1186.90077)]. The authors obtain the same order of iteration complexity as in the paper by Roos.
Recommendations
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- A full-modified-Newton step infeasible interior-point algorithm for linear optimization
- A modified full-Newton step infeasible interior-point algorithm for linear optimization
- An improved infeasible interior-point method with full-Newton step for linear optimization
- An improved and simplified full-Newton step O(n) infeasible interior-point method for linear optimization
- An adaptive infeasible interior-point algorithm with full-Newton step 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 full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
- An infeasible interior-point algorithm for convex quadratic programming with full-Newton step
Cites work
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
- A new class of polynomial primal-dual methods for linear and semidefinite optimization
- A new primal-dual path-following method for convex quadratic programming
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 1862745 (Why is no real title available?)
- New complexity analysis of the primal-dual Newton method for linear optimization
- Optimization theory and methods. Nonlinear programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
- The complexity of self-regular proximity based infeasible IPMs
Cited in
(29)- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem
- Simplified infeasible interior-point algorithm for linear optimization based on a simple function
- A full-modified-Newton step infeasible interior-point algorithm for linear optimization
- A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function
- A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
- A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function
- 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 full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity
- An improved infeasible interior-point method with full-Newton step for linear optimization
- AN ADAPTIVE PRIMAL-DUAL FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION
- Infeasible interior-point methods for linear optimization based on large neighborhood
- A full-Newton step infeasible interior-point algorithm for linear programming based on a self-regular proximity
- Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step
- A predictor-corrector algorithm with multiple corrections for convex quadratic programming
- A full NT-step infeasible interior-point algorithm for semidefinite optimization
- An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization
- A modified infeasible-interior-point algorithm for linear optimization problems
- Sharper analysis of upper bound for the iteration complexity of an interior-point method using primal-dual full-Newton step algorithm
- A new infeasible interior-point algorithm for linear complementarity problem
- 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
- A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term
- A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
- A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
- Convergence of the homotopy path for a full-Newton step infeasible interior-point method
- Improved full-Newton step O(nL) infeasible interior-point method for linear optimization
This page was built for publication: An infeasible interior-point algorithm with full-Newton step for linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464638)
